Random access sequence generation method, device, and system

ABSTRACT

Embodiments of the present application provide a random access sequence generation method, and an apparatus. The method includes: generating, by a base station, notification signaling, where the notification signaling includes indication information, the indication information is used to instruct user equipment UE to select a shift sequence number from a range of 0 to 
               (         n   shift   RA     ⁢     n   group   RA       +       n   _     shift   RA     +         n   _     _     shift   RA     +           n   _     _     _     shift   RA     -   1     )     ,         
the shift sequence number is an integer, n shift   RA  is a quantity of UE candidate sequence shifts in a group, n group   RA  is a quantity of groups,  n   shift   RA  is a quantity of UE candidate sequence shifts in the last length that is insufficient for a group,  n   shift   RA  is a quantity of UE candidate sequence shifts in first remaining sequence shifts, and   is a quantity of UE candidate sequence shifts in second remaining sequence shifts; and sending, by the base station, the notification signaling to the UE, so that the UE generates a random access sequence according to the indication information.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of International Application No.PCT/CN2015/090838, filed on Sep. 25, 2015, the disclosure of which ishereby incorporated by reference in its entirety.

TECHNICAL FIELD

Embodiments of the present application relate to communicationstechnologies, and in particular, to a random access sequence generationmethod, a device, and a system.

BACKGROUND

If user equipment (UE) communicates with a base station when the UEmoves at a high speed, there is a change between signal frequencies atreceive ends of the UE and the base station. The change is referred toas a Doppler frequency shift.

In the conventional art, to avoid a problem that random access sequencesof multiple UEs interfere with each other when the Doppler frequencyshift is greater than one time a physical random access channel (PRACH)subcarrier spacing and is less than two times the PRACH subcarrierspacing, a targeted design is made. In the conventional art, sequenceshifts are grouped, three parameters, that is, a quantity of groups, aquantity of UE candidate sequence shifts in a group, and a quantity ofUE candidate sequence shifts in the last length that is insufficient fora group, are determined, and a shift sequence number is selected from aninterval that is determined according to the three parameters.

However, in the conventional art, a range from which a shift sequencenumber is selected is excessively small.

SUMMARY

Embodiments of the present application provide a random access sequencegeneration method, a device, and a system.

According to a first aspect, an embodiment of the present applicationprovides a random access sequence generation method, including:

generating, by a base station, notification signaling, where thenotification signaling includes indication information, the indicationinformation is used to instruct user equipment UE to select a shiftsequence number from a range of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} ),$the shift sequence number is an integer, n_(shift) ^(RA) is a quantityof UE candidate sequence shifts in a group, n_(group) ^(RA) is aquantity of groups, n _(shift) ^(RA) is a quantity of UE candidatesequence shifts in the last length that is insufficient for a group, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in firstremaining sequence shifts, and

is a quantity of UE candidate sequence shifts in second remainingsequence shifts; and

sending, by the base station, the notification signaling to the UE, sothat the UE generates a random access sequence according to theindication information.

With reference to the first aspect, in a first possible implementationof the first aspect, after the sending, by the base station, thenotification signaling to the UE, the method further includes:

selecting, by the base station, a shift sequence number from the rangeof 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} );$

obtaining, by the base station, a cyclic shift value according to theshift sequence number; and

generating, by the base station, a detection sequence according to thecyclic shift value, and detecting, by using the detection sequence, therandom access sequence sent by the UE, where the random access sequenceis generated by the UE according to the indication information.

With reference to the first possible implementation of the first aspect,in a second possible implementation of the first aspect, the obtaining,by the base station, a cyclic shift value according to the shiftsequence number includes:

obtaining, by the base station, the cyclic shift value C_(v) accordingto the shift sequence number v by using the following formula (1),formula (2), or formula (3):

$\begin{matrix}{{C_{v} = {d_{offset} + {d_{start}\lfloor {v/n_{shift}^{RA}} \rfloor} + {( {v\mspace{11mu}{mod}\mspace{11mu} n_{shift}^{RA}} )N_{CS}}}};} & (1) \\{{C_{v} = {d_{offset} + {\overset{\_}{\overset{\_}{d}}}_{start} + {( {v - {n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA}} )N_{CS}}}};} & (2) \\{{C_{v} = {d_{offset} + {\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} + {( {v - {n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}} )N_{CS}}}},} & (3)\end{matrix}$where

d_(offset) is a shift offset, d_(start) is a cyclic shift distancebetween neighboring groups, n_(shift) ^(RA) is a quantity of UEcandidate sequence shifts in a group, N_(CS) is a quantity of cyclicshifts that are occupied by a user, d _(start) is a cyclic shift valueof a first UE candidate sequence shift in the first remaining sequenceshifts, and

is a cyclic shift value of a first UE candidate sequence shift in thesecond remaining sequence shifts.

With reference to the second possible implementation of the firstaspect, in a third possible implementation of the first aspect, in thecase of v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1), the basestation obtains the cyclic shift value C_(v) by using formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1)<v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift)^(RA)−1), the base station obtains the cyclic shift value C_(v) by usingformula (2);

in the case of

${( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} - 1} ) < v \leq ( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} )},$the base station obtains the cyclic shift value C_(v) by using formula(3).

With reference to the second or the third possible implementation of thefirst aspect, in a fourth possible implementation of the first aspect,n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11) where

formulas (4) to (11), are respectively:

$\begin{matrix}{{n_{shift}^{RA} = \lfloor \frac{{4d_{u}} - N_{ZC}}{N_{CS}} \rfloor};} & (4) \\{{d_{start} = {{4d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (5) \\{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor};} & (6) \\{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{N_{ZC} - {3d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};} & (7) \\{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = \lfloor {\min{( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} )/N_{CS}}} \rfloor};} & (8) \\{{{\overset{\_}{\overset{\_}{d}}}_{start} = {N_{ZC} - {3d_{u}} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};} & (9) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = {\lfloor {( {{( {1 - {\min( {1,{\overset{\_}{n}}_{shift}^{RA}} )}} )( {d_{u} - {n_{group}^{RA} \cdot d_{start}}} )} + {{\min( {1,{\overset{\_}{n}}_{shift}^{RA}} )}( {{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}} )}} )/N_{CS}} \rfloor - {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}}};} & (10) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = {N_{ZC} - {2d_{u}} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}N_{CS}}}},} & (11)\end{matrix}$where

d_(u) is a cyclic shift corresponding to the random access sequence whena Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to the second or the third possible implementation of thefirst aspect, in a fifth possible implementation of the first aspect,n_(shift) ^(RA), d_(start), n_(group) ^(RA),n _(shift) ^(RA), n _(shift)^(RA),

, d _(start), and

satisfy formulas (12) to (19), where

formulas (12) to (19) are respectively:

$\begin{matrix}{{n_{shift}^{RA} = \lfloor \frac{N_{ZC} - {3d_{u}}}{N_{CS}} \rfloor};} & (12) \\{{d_{start} = {N_{ZC} - {3d_{u}} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (13) \\{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor};} & (14) \\{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{{4d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};} & (15) \\{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = \lfloor {{\min( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{N_{ZC} - {3d_{u}} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} )}/N_{CS}} \rfloor};} & (16) \\{{{\overset{\_}{\overset{\_}{d}}}_{start} = {d_{u} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};} & (17) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0};} & (18) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = 0},} & (19)\end{matrix}$where

d_(u) is a cyclic shift corresponding to the random access sequence whena Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to the second or the third possible implementation of thefirst aspect, in a sixth possible implementation of the first aspect,n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), where

formulas (20) to (27) are respectively:

$\begin{matrix}{{n_{shift}^{RA} = \lfloor \frac{{3d_{u}} - N_{ZC}}{N_{CS}} \rfloor};} & (20) \\{{d_{start} = {{3d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (21) \\{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor};} & (22) \\{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{N_{ZC} - {2d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};} & (23) \\{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = 0};} & (24) \\{{{\overset{\_}{\overset{\_}{d}}}_{start} = 0};} & (25) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0};} & (26) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = 0},} & (27)\end{matrix}$where

d_(u) is a cyclic shift corresponding to the random access sequence whena Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to the second or the third possible implementation of thefirst aspect, in a seventh possible implementation of the first aspect,n_(shift) ^(RA), d_(start), n_(group) ^(RA),n _(shift) ^(RA), n _(shift)^(RA),

, d _(start), and

satisfy formulas (28) to (35), where

formulas (28) to (35) are respectively:

$\begin{matrix}{{n_{shift}^{RA} = \lfloor \frac{N_{ZC} - {2d_{u}}}{N_{CS}} \rfloor};} & (28) \\{{d_{start} = {{2( {N_{ZC} - {2d_{u}}} )} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (29) \\{{n_{group}^{RA} = \lfloor \frac{N_{ZC} - d_{u}}{d_{start}} \rfloor};} & (30) \\{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{{3d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};} & (31) \\{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = 0};} & (32) \\{{{\overset{\_}{\overset{\_}{d}}}_{start} = 0};} & (33) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0};} & (34) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = 0},} & (35)\end{matrix}$where

d_(u) is a cyclic shift corresponding to the random access sequence whena Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to any one of the fourth to the seventh possibleimplementations of the first aspect, in an eighth possibleimplementation of the first aspect, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19);

in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35); or in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2N_{ZC}}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

According to a second aspect, an embodiment of the present applicationprovides a random access sequence generation method, including:

receiving, by user equipment UE, notification signaling from a basestation, where the notification signaling includes indicationinformation, the indication information is used to instruct the UE toselect a shift sequence number from a range of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} ),$the shift sequence number is an integer, n_(shift) ^(RA) is a quantityof UE candidate sequence shifts in a group, n_(group) ^(RA) is aquantity of groups, n _(shift) ^(RA) is a quantity of UE candidatesequence shifts in the last length that is insufficient for a group, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in firstremaining sequence shifts, and

is a quantity of UE candidate sequence shifts in second remainingsequence shifts;

selecting, by the UE, a shift sequence number from the range of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} )$according to the notification signaling;

obtaining, by the UE, a cyclic shift value according to the shiftsequence number; and

generating, by the UE, a random access sequence according to the cyclicshift value.

With reference to the second aspect, in a first possible implementationof the second aspect, the obtaining, by the UE, a cyclic shift valueaccording to the shift sequence number includes:

obtaining, by the UE, the cyclic shift value C_(v) according to theshift sequence number v by using the following formula (1), formula (2),or formula (3):

$\begin{matrix}{{C_{v} = {d_{offset} + {d_{start}\lfloor {v/n_{shift}^{RA}} \rfloor} + {( {v\;{mod}\; n_{shift}^{RA}} )N_{CS}}}};} & (1) \\{{C_{v} = {d_{offset} + {\overset{\_}{\overset{\_}{d}}}_{start} + {( {v - {n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA}} )N_{CS}}}};} & (2) \\{{C_{v} = {d_{offset} + {\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} + {( {v - {n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}} )N_{CS}}}},} & (3)\end{matrix}$where

d_(offset) is a shift offset, d^(start) is a cyclic shift distancebetween neighboring groups, n_(shift) ^(RA) is a quantity of UEcandidate sequence shifts in a group, N_(CS) is a quantity of cyclicshifts that are occupied by a user, d _(start) is a cyclic shift valueof a first UE candidate sequence shift in the first remaining sequenceshifts, and

is a cyclic shift value of a first UE candidate sequence shift in thesecond remaining sequence shifts.

With reference to the first possible implementation of the secondaspect, in a second possible implementation of the second aspect, in thecase of v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1), the UEobtains the cyclic shift value C_(v) by using formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1)<v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift)^(RA)−1), the UE obtains the cyclic shift value C_(v) by using formula(2);

in the case of

${( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} - 1} ) < v \leq ( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} )},$the UE obtains the cyclic shift value C_(v) by using formula (3).

With reference to the first or the second possible implementation of thesecond aspect, in a third possible implementation of the second aspect,n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

start satisfy formulas (4) to (11), where

formulas (4) to (11) are respectively:

$\begin{matrix}{{n_{shift}^{RA} = \lfloor \frac{{4d_{u}} - N_{ZC}}{N_{CS}} \rfloor};} & (4) \\{{d_{start} = {{4d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (5) \\{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor};} & (6) \\{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{N_{ZC} - {3d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};} & (7) \\{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = \lfloor {{\min( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} )}\text{/}N_{CS}} \rfloor};} & (8) \\{{{\overset{\_}{\overset{\_}{d}}}_{start} = {N_{ZC} - {3d_{u}} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};} & (9) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = {\lfloor {( {{( {1 - {\min( {1,{\overset{\_}{n}}_{shift}^{RA}} )}} )( {d_{u} - {n_{group}^{RA} \cdot d_{start}}} )} + {{\min( {1,{\overset{\_}{n}}_{shift}^{RA}} )}( {{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}} )}} )\text{/}N_{CS}} \rfloor - {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}}};} & (10) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = {N_{ZC} - {2d_{u}} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}N_{CS}}}},} & (11)\end{matrix}$where

d_(u) is a cyclic shift corresponding to the random access sequence whena Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to the first or the second possible implementation of thesecond aspect, in a fourth possible implementation of the second aspect,n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19), where

formulas (12) to (19) are respectively:

$\begin{matrix}{{n_{shift}^{RA} = \lfloor \frac{N_{ZC} - {3d_{u}}}{N_{CS}} \rfloor};} & (12) \\{{d_{start} = {N_{ZC} - {3d_{u}} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (13) \\{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor};} & (14) \\{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{{4d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};} & (15) \\{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = \lfloor {{\min( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{N_{ZC} - {3d_{u}} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} )}\text{/}N_{CS}} \rfloor};} & (16) \\{{{\overset{\_}{\overset{\_}{d}}}_{start} = {d_{u} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};} & (17) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0};} & (18) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = 0},} & (19)\end{matrix}$where

d_(u) is a cyclic shift corresponding to the random access sequence whena Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to the first or the second possible implementation of thesecond aspect, in a fifth possible implementation of the second aspect,n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), where and

formulas (20) to (27) are respectively:

$\begin{matrix}{{n_{shift}^{RA} = \lfloor \frac{{3d_{u}} - N_{ZC}}{N_{CS}} \rfloor};} & (20) \\{{d_{start} = {{3d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (21) \\{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor};} & (22) \\{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{N_{ZC} - {2d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};} & (23) \\{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = 0};} & (24) \\{{{\overset{\_}{\overset{\_}{d}}}_{start} = 0};} & (25) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0};} & (26) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = 0},} & (27)\end{matrix}$where

d_(u) is a cyclic shift corresponding to the random access sequence whena Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to the first or the second possible implementation of thesecond aspect, in a sixth possible implementation of the second aspect,n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35), where

formulas (28) to (35) are respectively:

$\begin{matrix}{{n_{shift}^{RA} = \lfloor \frac{N_{ZC} - {2d_{u}}}{N_{CS}} \rfloor};} & (28) \\{{d_{start} = {{2( {N_{ZC} - {2d_{u}}} )} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (29) \\{{n_{group}^{RA} = \lfloor \frac{N_{ZC} - d_{u}}{d_{start}} \rfloor};} & (30) \\{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{{3d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};} & (31) \\{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = 0};} & (32) \\{{{\overset{\_}{\overset{\_}{d}}}_{start} = 0};} & (33) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0};} & (34) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = 0},} & (35)\end{matrix}$where

d_(u) is a cyclic shift corresponding to the random access sequence whena Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to any one of the third to the sixth possibleimplementations of the second aspect, in a seventh possibleimplementation of the second aspect, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19);

in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35); or in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2N_{ZC}}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

With reference to any one of the second aspect, or the first to theseventh possible implementations of the second aspect, in an eighthpossible implementation of the second aspect, the generating, by the UE,a random access sequence according to the cyclic shift value includes:

generating, by the UE, the random access sequence x_(u,C) _(v) (n)according to the cyclic shift value C_(v) by using the following formula(36):x _(u,C) _(v) (n)=x _(u)((n+C _(v))mod N _(ZC)  (36),where

N_(ZC) is a sequence length, and a ZC sequence whose root is u isdefined as:

${{x_{u}(n)} = e^{{- j}\frac{\pi\;{{un}{({n + 1})}}}{N_{ZC}}}},$0≤n≤N_(ZC)−1.

According to a third aspect, an embodiment of the present applicationprovides a random access sequence generation method, including:

selecting, by a base station, a shift sequence number v from a range of0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} ),$where v is an integer, n_(shift) ^(RA) is a quantity of user equipmentUE candidate sequence shifts in a group, n_(group) ^(RA) is a quantityof groups, n _(shift) ^(RA) is a quantity of UE candidate sequenceshifts in the last length that is insufficient for a group, n _(shift)^(RA) is a quantity of UE candidate sequence shifts in first remainingsequence shifts, and

is a quantity of UE candidate sequence shifts in second remainingsequence shifts; and

obtaining, by the base station, a cyclic shift value C_(v) according tothe shift sequence number v by using the following formula (1), formula(2), or formula (3):

$\begin{matrix}{{C_{v} = {d_{offset} + {d_{start}\lfloor {v/n_{shift}^{RA}} \rfloor} + {( {v\;{mod}\; n_{shift}^{RA}} )N_{CS}}}};} & (1) \\{{C_{v} = {d_{offset} + {\overset{\_}{\overset{\_}{d}}}_{start} + {( {v - {n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA}} )N_{CS}}}};} & (2) \\{{C_{v} = {d_{offset} + {\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} + {( {v - {n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}} )N_{CS}}}},} & (3)\end{matrix}$where

d_(offset) is a shift offset, d_(start) is a cyclic shift distancebetween neighboring groups, n_(shift) ^(RA) is a quantity of UEcandidate sequence shifts in a group, N_(CS) is a quantity of cyclicshifts that are occupied by a user, d _(start) is a cyclic shift valueof a first UE candidate sequence shift in the first remaining sequenceshifts, and

is a cyclic shift value of a first UE candidate sequence shift in thesecond remaining sequence shifts, where

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11); or n_(shift) ^(RA), d_(start), n_(group)^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or n_(shift) ^(RA), d_(start), n_(group)^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27); or n_(shift) ^(RA), d_(start), n_(group)^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35), where

$\begin{matrix}{{n_{shift}^{RA} = \lfloor \frac{{4d_{u}} - N_{ZC}}{N_{CS}} \rfloor};} & (4) \\{{d_{start} = {{4d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (5) \\{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor};} & (6) \\{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{N_{ZC} - {3d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};} & (7) \\{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = \lfloor {{\min( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} )}\text{/}N_{CS}} \rfloor};} & (8) \\{{{\overset{\_}{\overset{\_}{d}}}_{start} = {N_{ZC} - {3d_{u}} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};} & (9) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = {\lfloor {( {{( {1 - {\min( {1,{\overset{\_}{n}}_{shift}^{RA}} )}} )( {d_{u} - {n_{group}^{RA} \cdot d_{start}}} )} + {{\min( {1,{\overset{\_}{n}}_{shift}^{RA}} )}( {{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}} )}} )\text{/}N_{CS}} \rfloor - {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}}};} & (10) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = {N_{ZC} - {2d_{u}} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}N_{CS}}}};} & (11) \\{{n_{shift}^{RA} = \lfloor \frac{N_{ZC} - {3d_{u}}}{N_{CS}} \rfloor};} & (12) \\{{d_{start} = {N_{ZC} - {3d_{u}} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (13) \\{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor};} & (14) \\{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{{4d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};} & (15) \\{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = \lfloor {{\min( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{N_{ZC} - {3d_{u}} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} )}\text{/}N_{CS}} \rfloor};} & (16) \\{{{\overset{\_}{\overset{\_}{d}}}_{start} = {d_{u} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};} & (17) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0};} & (18) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = 0};} & (19) \\{{n_{shift}^{RA} = \lfloor \frac{{3d_{u}} - N_{ZC}}{N_{CS}} \rfloor};} & (20) \\{{d_{start} = {{3d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (21) \\{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor};} & (22) \\{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{N_{ZC} - {2d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};} & (23) \\{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = 0};} & (24) \\{{{\overset{\_}{\overset{\_}{d}}}_{start} = 0};} & (25) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0};} & (26) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = 0};} & (27) \\{{n_{shift}^{RA} = \lfloor \frac{N_{ZC} - {2d_{u}}}{N_{CS}} \rfloor};} & (28) \\{{d_{start} = {{2( {N_{ZC} - {2d_{u}}} )} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (29) \\{{n_{group}^{RA} = \lfloor \frac{N_{ZC} - d_{u}}{d_{start}} \rfloor};} & (30) \\{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{{3d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};} & (31) \\{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = 0};} & (32) \\{{{\overset{\_}{\overset{\_}{d}}}_{start} = 0};} & (33) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0};} & (34) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = 0},} & (35)\end{matrix}$where

N_(ZC) is a sequence length, d_(u) is a cyclic shift corresponding tothe random access sequence when a Doppler frequency shift is one time aPRACH subcarrier spacing.

With reference to the third aspect, in a first possible implementationof the third aspect, in the case of v≤(n_(shift) ^(RA)n_(group) ^(RA)+n_(shift) ^(RA)−1), the base station obtains the cyclic shift value C_(v)by using formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1)<v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift)^(RA)−1), the base station obtains the cyclic shift value C_(v) by usingformula (2);

in the case of

${( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} - 1} ) < v \leq ( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} )},$the base station obtains the cyclic shift value C_(v) by using formula(3).

With reference to the third aspect or the first possible implementationof the third aspect, in a second possible implementation of the thirdaspect, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19);

in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35); or in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2N_{ZC}}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

According to a fourth aspect, an embodiment of the present applicationprovides a random access sequence generation method, including:

selecting, by user equipment UE, a shift sequence number v from a rangeof 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} ),$where v is an integer, n_(shift) ^(RA) is a quantity of UE candidatesequence shifts in a group, n_(group) ^(RA) is a quantity of groups, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in the lastlength that is insufficient for a group, n _(shift) ^(RA) is a quantityof UE candidate sequence shifts in first remaining sequence shifts, and

is a quantity of UE candidate sequence shifts in second remainingsequence shifts;

obtaining, by the UE, a cyclic shift value C_(v) according to the shiftsequence number v by using the following formula (1), formula (2), orformula (3):

$\begin{matrix}{{C_{v} = {d_{offset} + {d_{start}\lfloor {v/n_{shift}^{RA}} \rfloor} + {( {v\;{mod}\; n_{shift}^{RA}} )N_{CS}}}};} & (1) \\{{C_{v} = {d_{offset} + {\overset{\_}{\overset{\_}{d}}}_{start} + {( {v - {n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA}} )N_{CS}}}};} & (2) \\{{C_{v} = {d_{offset} + {\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} + {( {v - {n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}} )N_{CS}}}},} & (3)\end{matrix}$where

d_(offset) is a shift offset, d_(start) start is a cyclic shift distancebetween neighboring groups, n_(shift) ^(RA) is a quantity of UEcandidate sequence shifts in a group, N_(CS) is a quantity of cyclicshifts that are occupied by a user, d _(start) is a cyclic shift valueof a first UE candidate sequence shift in the first remaining sequenceshifts, and

is a cyclic shift value of a first UE candidate sequence shift in thesecond remaining sequence shifts; and

generating, by the UE, a random access sequence x_(u,C) _(v) (n)according to the cyclic shift value C_(v) by using the following formula(36):x _(u,C) _(v) (n)=x _(u)((n+C _(v))mod N _(ZC))  (36),where

N_(ZC) is a sequence length, and a ZC sequence whose root is u isdefined as:

${{x_{u}(n)} = e^{{- j}\frac{\pi\;{{un}{({n + 1})}}}{N_{ZC}}}},$0≤n≤N_(ZC)−1, where

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11); or

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n_(shift) ^(−RA),n_(shift)^(=RA),

, d_(start) ⁼, and

satisfy formulas (12) to (19); or n_(shift) ^(RA), d_(start), n_(group)^(RA), n_(shift) ^(−RA), n_(shift) ^(=RA),

, d_(start) ⁼, and

satisfy formulas (20) to (27); or n_(shift) ^(RA), d_(start), n_(group)^(RA), n_(shif) ^(−RA), n_(shift) ^(=RA),

, d_(start) ⁼, and

satisfy formulas (28) to (35), where

$\begin{matrix}{{n_{shift}^{RA} = \lfloor \frac{{4d_{u}} - N_{ZC}}{N_{CS}} \rfloor};} & (4) \\{{d_{start} = {{4d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (5) \\{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor};} & (6) \\{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{N_{ZC} - {3d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};} & (7)\end{matrix}$

$\begin{matrix}{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = \lfloor {{\min( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{{4\; d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} )}/N_{CS}} \rfloor};} & (8) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{d}}}_{start} = {N_{ZC} - {3\; d_{u}} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};}} & (9) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = {\lfloor {( {{( {1 - {\min( {1,{\overset{\_}{n}}_{shift}^{RA}} )}} )( {d_{u} - {n_{group}^{RA} \cdot d_{start}}} )} + {{\min( {1,{\overset{\_}{n}}_{shift}^{RA}} )}( {{4\; d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}} )}} )/N_{CS}} \rfloor - {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA}}};} & (10) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = {N_{ZC} - {2d_{u}} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}N_{CS}}}};}} & (11) \\{\mspace{79mu}{{n_{shift}^{RA} = \lfloor \frac{N_{ZC} - {3\; d_{u}}}{N_{CS}} \rfloor};}} & (12) \\{\mspace{79mu}{{d_{start} = {N_{ZC} - {3\; d_{u}} + {n_{shift}^{RA} \cdot N_{CS}}}};}} & (13) \\{\mspace{79mu}{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor};}} & (14) \\{\mspace{79mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{{4\; d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};}} & (15) \\{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = \lfloor {{\min( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{N_{ZC} - {3\; d_{u}} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} )}/N_{CS}} \rfloor};} & (16) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{d}}}_{start} = {{d_{u} \cdot n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};}} & (17) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0};}} & (18) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = 0};}} & (19) \\{\mspace{79mu}{{n_{shift}^{RA} = \lfloor \frac{{3\; d_{u}} - N_{ZC}}{N_{CS}} \rfloor};}} & (20) \\{\mspace{79mu}{{d_{start} = {{3\; d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};}} & (21) \\{\mspace{79mu}{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor};}} & (22) \\{\mspace{79mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{N_{ZC} - {2\; d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};}} & (23) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = 0};}} & (24) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{d}}}_{start} = 0};}} & (25) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0};}} & (26) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = 0};}} & (27) \\{\mspace{79mu}{{n_{shift}^{RA} = \lfloor \frac{N_{ZC} - {2\; d_{u}}}{N_{CS}} \rfloor};}} & (28) \\{\mspace{79mu}{{d_{start} = {{2( {N_{ZC} - {2\; d_{u}}} )} + {n_{shift}^{RA} \cdot N_{CS}}}};}} & (29) \\{\mspace{79mu}{{n_{group}^{RA} = \lfloor \frac{N_{ZC} - d_{u}}{d_{start}} \rfloor};}} & (30) \\{\mspace{79mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{{3\; d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};}} & (31) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = 0};}} & (32) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{d}}}_{start} = 0};}} & (33) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0};}} & (34) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = 0},}} & (35)\end{matrix}$where

d_(u) is a cyclic shift corresponding to the random access sequence whena Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to the fourth aspect, in a first possible implementationof the fourth aspect, in the case of v≤(n_(shift) ^(RA)n_(group) ^(RA)+n_(shift) ^(RA)−1), the UE obtains the cyclic shift value C_(v) by usingformula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1)<v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift)^(RA)−1), the UE obtains the cyclic shift value C_(v) by using formula(2);

in the case of

${( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} - 1} ) < v \leq ( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} )},$the UE obtains the cyclic shift value C_(v) by using formula (3).

With reference to the fourth aspect or the first possible implementationof the fourth aspect, in a second possible implementation of the fourthaspect, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19);

in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35); or in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2N_{ZC}}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

According to a fifth aspect, an embodiment of the present applicationprovides a base station, including:

a generation module, configured to generate notification signaling,where the notification signaling includes indication information, theindication information is used to instruct user equipment UE to select ashift sequence number from a range of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} ),$the shift sequence number is an integer, n_(shift) ^(RA)is a quantity ofUE candidate sequence shifts in a group, n_(group) ^(RA) is a quantityof groups, n _(shift) ^(RA) is a quantity of UE candidate sequenceshifts in the last length that is insufficient for a group, n _(shift)^(RA) shift is a quantity of UE candidate sequence shifts in firstremaining sequence shifts, and

is a quantity of UE candidate sequence shifts in second remainingsequence shifts; and

a sending module, configured to send the notification signaling to theUE, so that the UE generates a random access sequence according to theindication information.

With reference to the fifth aspect, in a first possible implementationof the fifth aspect, the base station further includes:

a shift sequence number determining module, configured to select a shiftsequence number from the range of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} );$

a cyclic shift value determining module, configured to obtain a cyclicshift value according to the shift sequence number; and

a random access sequence detection module, configured to: generate adetection sequence according to the cyclic shift value, and detect, byusing the detection sequence, the random access sequence sent by the UE,where the random access sequence is generated by the UE according to theindication information.

With reference to the first possible implementation of the fifth aspect,in a second possible implementation of the fifth aspect, the cyclicshift value determining module is specifically configured to:

obtain the cyclic shift value C_(v) according to the shift sequencenumber v by using the following formula (1), formula (2), or formula(3):

$\begin{matrix}{{C_{v} = {d_{offset} + {d_{start}\lfloor {v/n_{shift}^{RA}} \rfloor} + {( {v\;{mod}\; n_{shift}^{RA}} )N_{CS}}}};} & (1) \\{{C_{v} = {d_{offset} + {\overset{\_}{\overset{\_}{d}}}_{start} + {( {v - {n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA}} )N_{CS}}}};} & (2) \\{{C_{v} = {d_{offset} + {\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} + {( {v - {n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}} )N_{CS}}}},} & (3)\end{matrix}$where

d_(offset) is a shift offset, d_(start) start is a cyclic shift distancebetween neighboring groups, n_(shift) ^(RA) is a quantity of UEcandidate sequence shifts in a group, N_(CS) is a quantity of cyclicshifts that are occupied by a user, d _(start) is a cyclic shift valueof a first UE candidate sequence shift in the first remaining sequenceshifts, and

is a cyclic shift value of a first UE candidate sequence shift in thesecond remaining sequence shifts.

With reference to the second possible implementation of the fifthaspect, in a third possible implementation of the fifth aspect, in thecase of v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1), thecyclic shift value determining module obtains the cyclic shift valueC_(v) by using formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1)<v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift)^(RA)−1), the cyclic shift the cyclic shift value determining moduleobtains the cyclic shift value C_(v) by using formula (2);

in the case of

${( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} - 1} ) < v \leq ( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} )},$the cyclic shift value determining module obtains the cyclic shift valueC_(v) by using formula (3).

With reference to the second or the third possible implementation of thefifth aspect, in a fourth possible implementation of the fifth aspect,n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11, where

formulas (4) to (11) are respectively:

$\begin{matrix}{{n_{shift}^{RA} = \lfloor \frac{{4d_{u}} - N_{ZC}}{N_{CS}} \rfloor};} & (4) \\{{d_{start} = {{4d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (5) \\{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor};} & (6) \\{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{N_{ZC} - {3d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};} & (7) \\{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = \lfloor {{\min( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} )}\text{/}N_{CS}} \rfloor};} & (8) \\{{{\overset{\_}{\overset{\_}{d}}}_{start} = {N_{ZC} - {3d_{u}} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};} & (9) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = {\lfloor {( {{( {1 - {\min( {1,{\overset{\_}{n}}_{shift}^{RA}} )}} )( {d_{u} - {n_{group}^{RA} \cdot d_{start}}} )} + {{\min( {1,{\overset{\_}{n}}_{shift}^{RA}} )}( {{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}} )}} )\text{/}N_{CS}} \rfloor - {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}}};} & (10) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = {N_{ZC} - {2d_{u}} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}N_{CS}}}},} & (11)\end{matrix}$where

d_(u) is a cyclic shift corresponding to the random access sequence whena Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to the second or the third possible implementation of thefifth aspect, in a fifth possible implementation of the fifth aspect,n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19), where

formulas (12) to (19) are respectively:

$\begin{matrix}{{n_{shift}^{RA} = \lfloor \frac{N_{ZC} - {3d_{u}}}{N_{CS}} \rfloor};} & (12) \\{{d_{start} = {N_{ZC} - {3d_{u}} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (13) \\{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor};} & (14) \\{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{{4d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};} & (15) \\{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = \lfloor {{\min( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{N_{ZC} - {3d_{u}} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} )}\text{/}N_{CS}} \rfloor};} & (16) \\{{{\overset{\_}{\overset{\_}{d}}}_{start} = {d_{u} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};} & (17) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0};} & (18) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = 0},} & (19)\end{matrix}$where

d_(u) is a cyclic shift corresponding to the random access sequence whena Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to the second or the third possible implementation of thefifth aspect, in a sixth possible implementation of the fifth aspect,n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), where

formulas (20) to (27) are respectively:

$\begin{matrix}{{n_{shift}^{RA} = \lfloor \frac{{3d_{u}} - N_{ZC}}{N_{CS}} \rfloor};} & (20) \\{{d_{start} = {{3d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (21) \\{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor};} & (22) \\{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{N_{ZC} - {2d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};} & (23) \\{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = 0};} & (24) \\{{{\overset{\_}{\overset{\_}{d}}}_{start} = 0};} & (25) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0};} & (26) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = 0},} & (27)\end{matrix}$where

d_(u) is a cyclic shift corresponding to the random access sequence whena Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to the second or the third possible implementation of thefifth aspect, in a seventh possible implementation of the fifth aspect,n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35), where

formulas (28) to (35) are respectively:

$\begin{matrix}{{n_{shift}^{RA} = \lfloor \frac{N_{ZC} - {2d_{u}}}{N_{CS}} \rfloor};} & (28) \\{{d_{start} = {{2( {N_{ZC} - {2d_{u}}} )} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (29) \\{{n_{group}^{RA} = \lfloor \frac{N_{ZC} - d_{u}}{d_{start}} \rfloor};} & (30) \\{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{{3d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};} & (31) \\{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = 0};} & (32) \\{{{\overset{\_}{\overset{\_}{d}}}_{start} = 0};} & (33) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0};} & (34) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = 0},} & (35)\end{matrix}$where

d_(u) is a cyclic shift corresponding to the random access sequence whena Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to any one of the fourth to the seventh possibleimplementations of the fifth aspect, in an eighth possibleimplementation of the fifth aspect, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19), or in the case of

${\frac{N_{ZC} - N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19);

in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35); or in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2N_{ZC}}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

According to a sixth aspect, an embodiment of the present applicationprovides user equipment UE, including:

a receiving module, configured to receive notification signaling from abase station, where the notification signaling includes indicationinformation, the indication information is used to instruct the UE toselect a shift sequence number from a range of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} ),$the shift sequence number is an integer, n_(shift) ^(RA) is a quantityof UE candidate sequence shifts in a group, n_(group) ^(RA) is aquantity of groups, n _(shift) ^(RA) is a quantity of UE candidatesequence shifts in the last length that is insufficient for a group, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in firstremaining sequence shifts, and

is a quantity of UE candidate sequence shifts in second remainingsequence shifts;

a shift sequence number determining module, configured to select a shiftsequence number from the range of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} )$according to the notification signaling;

a cyclic shift value determining module, configured to obtain a cyclicshift value according to the shift sequence number; and

a random access sequence generation module, configured to generate arandom access sequence according to the cyclic shift value.

With reference to the sixth aspect, in a first possible implementationof the sixth aspect, the cyclic shift value determining module isspecifically configured to:

obtain the cyclic shift value C_(v) according to the shift sequencenumber v by using the following formula (1), formula (2), or formula(3):

$\begin{matrix}{{C_{v} = {d_{offset} + {d_{start}\lfloor {v/n_{shift}^{RA}} \rfloor} + {( {v{mod}n}_{shift}^{RA} )N_{CS}}}};} & (1) \\{{C_{v} = {d_{offset} + {\overset{\_}{\overset{\_}{d}}}_{start} + {( {v - {n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA}} )N_{CS}}}};} & (2) \\{{C_{v} = {d_{offset} + {\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} + {( {v - {n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}} )N_{CS}}}},} & (3)\end{matrix}$where

d_(offset) is a shift offset, d_(start) is a cyclic shift distancebetween neighboring groups, n_(shift) ^(RA) is a quantity of UEcandidate sequence shifts in a group, N_(CS) is a quantity of cyclicshifts that are occupied by a user, d _(start) is a cyclic shift valueof a first UE candidate sequence shift in the first remaining sequenceshifts, and

is a cyclic shift value of a first UE candidate sequence shift in thesecond remaining sequence shifts.

With reference to the first possible implementation of the sixth aspect,in a second possible implementation of the sixth aspect, in the case ofv≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1), the cyclic shiftvalue determining module obtains the cyclic shift value C_(v) by usingformula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1)<v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift)^(RA)−1), the cyclic shift value determining module obtains the cyclicshift value C_(v) by using formula (2);

in the case of

${( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\overset{\_}{\_}}{n}}_{shift}^{RA} - 1} ) < v \leq ( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} )},$the cyclic shift value determining module obtains the cyclic shift valueC_(v) by using formula (3).

With reference to the first or the second possible implementation of thesixth aspect, in a third possible implementation of the sixth aspect,n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), where

formulas (4) to (11) are respectively:

$\begin{matrix}{{n_{shift}^{RA} = \lfloor \frac{{4d_{u}} - N_{ZC}}{N_{CS}} \rfloor};} & (4) \\{{d_{start} = {{4d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (5) \\{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor};} & (6) \\{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{N_{ZC} - {3d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};} & (7) \\{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = \lfloor {{\min( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} )}\text{/}N_{CS}} \rfloor};} & (8) \\{{{\overset{\_}{\overset{\_}{d}}}_{start} = {N_{ZC} - {3d_{u}} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};} & (9) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = {\lfloor {( {{( {1 - {\min( {1,{\overset{\_}{n}}_{shift}^{RA}} )}} )( {d_{u} - {n_{group}^{RA} \cdot d_{start}}} )} + {{\min( {1,{\overset{\_}{n}}_{shift}^{RA}} )}( {{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}} )}} )\text{/}N_{CS}} \rfloor - {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}}};} & (10) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = {N_{ZC} - {2d_{u}} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}N_{CS}}}},} & (11)\end{matrix}$where

d_(u) is a cyclic shift corresponding to the random access sequence whena Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to the first or the second possible implementation of thesixth aspect, in a fourth possible implementation of the sixth aspect,n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19), where

formulas (12) to (19) are respectively:

$\begin{matrix}{{n_{shift}^{RA} = \lfloor \frac{N_{ZC} - {3d_{u}}}{N_{CS}} \rfloor};} & (12) \\{{d_{start} = {N_{ZC} - {3d_{u}} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (13) \\{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor};} & (14) \\{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{{4d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};} & (15) \\{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = \lfloor {{\min( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{N_{ZC} - {3d_{u}} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} )}\text{/}N_{CS}} \rfloor};} & (16) \\{{{\overset{\_}{\overset{\_}{d}}}_{start} = {d_{u} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};} & (17) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0};} & (18) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = 0},} & (19)\end{matrix}$where

d_(u) is a cyclic shift corresponding to the random access sequence whena Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to the first or the second possible implementation of thesixth aspect, in a fifth possible implementation of the sixth aspect,n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), where

formulas (20) to (27) are respectively:

$\begin{matrix}{{n_{shift}^{RA} = \lfloor \frac{{3d_{u}} - N_{ZC}}{N_{CS}} \rfloor};} & (20) \\{{d_{start} = {{3d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (21) \\{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor};} & (22) \\{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{N_{ZC} - {2d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};} & (23) \\{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = 0};} & (24) \\{{{\overset{\_}{\overset{\_}{d}}}_{start} = 0};} & (25) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0};} & (26) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = 0},} & (27)\end{matrix}$where

d_(u) is a cyclic shift corresponding to the random access sequence whena Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to the first or the second possible implementation of thesixth aspect, in a sixth possible implementation of the sixth aspect,n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35), where

formulas (28) to (35) are respectively:

$\begin{matrix}{{n_{shift}^{RA} = \lfloor \frac{N_{ZC} - {2d_{u}}}{N_{CS}} \rfloor};} & (28) \\{{d_{start} = {{2( {N_{ZC} - {2d_{u}}} )} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (29) \\{{n_{group}^{RA} = \lfloor \frac{N_{ZC} - d_{u}}{d_{start}} \rfloor};} & (30) \\{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{{3d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};} & (31) \\{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = 0};} & (32) \\{{{\overset{\_}{\overset{\_}{d}}}_{start} = 0};} & (33) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0};} & (34) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = 0},} & (35)\end{matrix}$where

d_(u) is a cyclic shift corresponding to the random access sequence whena Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to any one of the third to the sixth possibleimplementations of the sixth aspect, in a seventh possibleimplementation of the sixth aspect, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19);

in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35); or in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2N_{ZC}}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

start satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

With reference to any one of the sixth aspect, or the first to theseventh possible implementations of the sixth aspect, in an eighthpossible implementation of the sixth aspect, the random access sequencegeneration module is specifically configured to:

generate the random access sequence x_(u,C) _(v) (n) according to thecyclic shift value C_(v) by using the following formula (36):x _(u,C) _(v) (n)=x _(u)((n+C _(v))mod N _(ZC))  (36)where

N_(ZC) is a sequence length, and a ZC sequence whose root is u isdefined as:

${{x_{u}(n)} = e^{{- j}\frac{\pi\;{{un}{({n + 1})}}}{N_{ZC}}}},$0≤n≤N_(ZC)−1.

According to a seventh aspect, an embodiment of the present applicationprovides a base station, including:

a shift sequence number determining module, configured to select a shiftsequence number v from a range of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} ),$where v is an integer, n_(shift) ^(RA) is a quantity of user equipmentUE candidate sequence shifts in a group, n_(group) ^(RA) is a quantityof groups, n _(shift) ^(RA) is a quantity of UE candidate sequenceshifts in the last length that is insufficient for a group, n _(shift)^(RA) is a quantity of UE candidate sequence shifts in first remainingsequence shifts, and

is a quantity of UE candidate sequence shifts in second remainingsequence shifts; and

a cyclic shift value determining module, configured to obtain a cyclicshift value C_(v) according to the shift sequence number v by using thefollowing formula (1), formula (2), or formula (3):

$\begin{matrix}{{C_{v} = {d_{offset} + {d_{start}\lfloor {v/n_{shift}^{RA}} \rfloor} + {( {v{mod}n}_{shift}^{RA} )N_{CS}}}};} & (1) \\{{C_{v} = {d_{offset} + {\overset{\_}{\overset{\_}{d}}}_{start} + {( {v - {n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA}} )N_{CS}}}};} & (2) \\{{C_{v} = {d_{offset} + {\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} + {( {v - {n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}} )N_{CS}}}},} & (3)\end{matrix}$where

d_(offset) is a shift offset, d_(start) is a cyclic shift distancebetween neighboring groups, n_(shift) ^(RA) is a quantity of UEcandidate sequence shifts in a group, N_(CS) is a quantity of cyclicshifts that are occupied by a user, d _(start) is a cyclic shift valueof a first UE candidate sequence shift in the first remaining sequenceshifts, and

is a cyclic shift value of a first UE candidate sequence shift in thesecond remaining sequence shifts, where

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11); or n_(shift) ^(RA), d_(start), n_(group)^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or n_(shift) ^(RA), d_(start), n_(group)^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27); or n_(shift) ^(RA), d_(start), n_(group)^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35), where

$\begin{matrix}{\mspace{79mu}{{n_{shift}^{RA} = \lfloor \frac{{4d_{u}} - N_{ZC}}{N_{CS}} \rfloor};}} & (4) \\{\mspace{79mu}{{d_{start} = {{4d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};}} & (5) \\{\mspace{79mu}{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor};}} & (6) \\{\mspace{79mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{N_{ZC} - {3d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};}} & (7) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = \lfloor {{\min( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} )}/N_{CS}} \rfloor};}} & (8) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{d}}}_{start} = {N_{ZC} - {3d_{u}} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};}} & (9) \\{{n_{shift}^{RA} = {\lfloor {( {{( {1 - {\min( {1,{\overset{\_}{n}}_{shift}^{RA}} )}} )( {d_{u} - {n_{group}^{RA} \cdot d_{start}}} )} + {{\min( {1,{\overset{\_}{n}}_{shift}^{RA}} )}( {{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}} )}} )/N_{CS}} \rfloor - {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}}};} & (10) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = {N_{ZC} - {2d_{u}} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}N_{CS}}}};}} & (11) \\{\mspace{79mu}{{n_{group}^{RA} = \lfloor \frac{N_{ZC} - {3d_{u}}}{N_{CS}} \rfloor};}} & (12) \\{\mspace{79mu}{{d_{start} = {N_{ZC} - {3d_{u}} + {n_{shift}^{RA} \cdot N_{CS}}}};}} & (13) \\{\mspace{79mu}{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor};}} & (14) \\{\mspace{79mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{{4d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};}} & (15) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = \lfloor {{\min( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{N_{ZC} - {3d_{u}} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} )}/N_{CS}} \rfloor};}} & (16) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{d}}}_{start} = {d_{u} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};}} & (17) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0};}} & (18) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = 0};}} & (19) \\{\mspace{79mu}{{n_{shift}^{RA} = \lfloor \frac{{3d_{u}} - N_{ZC}}{N_{CS}} \rfloor};}} & (20) \\{\mspace{79mu}{{d_{start} = {{3d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};}} & (21) \\{\mspace{79mu}{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor};}} & (22) \\{\mspace{79mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{N_{ZC} - {2d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};}} & (23) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = 0};}} & (24) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{d}}}_{start} = 0};}} & (25) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0};}} & (26) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = 0};}} & (27) \\{\mspace{79mu}{{n_{group}^{RA} = \lfloor \frac{N_{ZC} - {2d_{u}}}{N_{CS}} \rfloor};}} & (28) \\{\mspace{79mu}{{d_{start} = {{2( {N_{ZC} - {2d_{u}}} )} + {n_{shift}^{RA} \cdot N_{CS}}}};}} & (29) \\{\mspace{79mu}{{n_{group}^{RA} = \lfloor \frac{N_{ZC} - d_{u}}{d_{start}} \rfloor};}} & (30) \\{\mspace{79mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{{3d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};}} & (31) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = 0};}} & (32) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{d}}}_{start} = 0};}} & (33) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0};}} & (34) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = 0},}} & (35)\end{matrix}$where

N_(ZC) is a sequence length, and d_(u) is a cyclic shift correspondingto the random access sequence when a Doppler frequency shift is one timea PRACH subcarrier spacing.

With reference to the seventh aspect, in a first possible implementationof the seventh aspect, in the case of v≤(n_(shift) ^(RA)n_(group)^(RA)+n _(shift) ^(RA)−1), determining module obtains the cyclic shiftvalue C_(v) by using formulas (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1)<v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift)^(RA)−1), the cyclic shift value determining module obtains the cyclicshift value C_(v) by using formula (2);

in the case of

${( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\overset{\_}{\_}}{n}}_{shift}^{RA} - 1} ) < v \leq ( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} )},$the cyclic shift value determining module obtains the cyclic shift valueC_(v) by using formula (3).

With reference to the seventh aspect or the first possibleimplementation of the seventh aspect, in a second possibleimplementation of the seventh aspect, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19);

in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35); or in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2N_{ZC}}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

According to an eighth aspect, an embodiment of the present applicationprovides user equipment UE, including:

a shift sequence number determining module, configured to select a shiftsequence number v from a range of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} ),$where v is an integer, n_(shift) ^(RA) is a quantity of UE candidatesequence shifts in a group, n_(group) ^(RA) is a quantity of groups, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in the lastlength that is insufficient for a group, n _(shift) ^(RA) is a quantityof UE candidate sequence shifts in first remaining sequence shifts, and

is a quantity of UE candidate sequence shifts in second remainingsequence shifts;

a cyclic shift value determining module, configured to obtain a cyclicshift value C_(v) according to the shift sequence number v by using thefollowing formula (1), formula (2), or formula (3):

$\begin{matrix}{{C_{v} = {d_{offset} + {d_{start}\lfloor {v/n_{shift}^{RA}} \rfloor} + {( {v{mod}n}_{shift}^{RA} )N_{CS}}}};} & (1) \\{{C_{v} = {d_{offset} + {\overset{\_}{\overset{\_}{d}}}_{start} + {( {v - {n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA}} )N_{CS}}}};} & (2) \\{{C_{v} = {d_{offset} + {\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} + {( {v - {n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}} )N_{CS}}}},} & (3)\end{matrix}$where

d_(offset) is a shift offset, d_(start) is a cyclic shift distancebetween neighboring groups, n_(shift) ^(RA) is a quantity of UEcandidate sequence shifts in a group, N_(CS) is a quantity of cyclicshifts that are occupied by a user, d _(start) is a cyclic shift valueof a first UE candidate sequence shift in the first remaining sequenceshifts, and

is a cyclic shift value of a first UE candidate sequence shift in thesecond remaining sequence shifts; and

a random access sequence generation module, configured to generate arandom access sequence x_(u,C) _(v) (n) according to the cyclic shiftvalue C_(v) by using the following formula (36):x _(u,C) _(v) (n)=x _(u)((n+C _(v))mod N _(ZC))  (36),where

N_(ZC) is a sequence length, and a ZC sequence whose root is u isdefined as:

${{x_{u}(n)} = e^{{- j}\frac{\pi\;{{un}{({n + 1})}}}{N_{ZC}}}},$0≤n≤N_(ZC)−1, where

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11); or n_(shift) ^(RA), d_(start), n_(group)^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or n_(shift) ^(RA), d_(start), n_(group)^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27); or n_(shift) ^(RA), d_(start), n_(group)^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35), where

$\begin{matrix}{\mspace{76mu}{{n_{shift}^{RA} = \lfloor \frac{{4d_{u}} - N_{ZC}}{N_{CS}} \rfloor};}} & (4) \\{\mspace{76mu}{{d_{start} = {{4d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};}} & (5) \\{\mspace{76mu}{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor};}} & (6) \\{\mspace{76mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{N_{ZC} - {3d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};}} & (7) \\{\mspace{76mu}{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = \lfloor {{\min( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} )}\text{/}N_{CS}} \rfloor};}} & (8) \\{\mspace{76mu}{{{\overset{\_}{\overset{\_}{d}}}_{start} = {N_{ZC} - {3d_{u}} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};}} & (9) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = {\lfloor {( {{( {1 - {\min( {1,{\overset{\_}{n}}_{shift}^{RA}} )}} )( {d_{u} - {n_{group}^{RA} \cdot d_{start}}} )} + {{\min( {1,{\overset{\_}{n}}_{shift}^{RA}} )}( {{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}} )}} )\text{/}N_{CS}} \rfloor - {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}}};} & (10) \\{\mspace{76mu}{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = {N_{ZC} - {2d_{u}} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}N_{CS}}}};}} & (11) \\{\mspace{76mu}{{n_{shift}^{RA} = \lfloor \frac{N_{ZC} - {3d_{u}}}{N_{CS}} \rfloor};}} & (12) \\{\mspace{76mu}{{d_{start} = {N_{ZC} - {3d_{u}} + {n_{shift}^{RA} \cdot N_{CS}}}};}} & (13) \\{\mspace{76mu}{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor};}} & (14) \\{\mspace{76mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{{4d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};}} & (15) \\{\mspace{76mu}{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = \lfloor {{\min( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{N_{ZC} - {3d_{u}} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} )}\text{/}N_{CS}} \rfloor};}} & (16) \\{\mspace{76mu}{{{\overset{\_}{\overset{\_}{d}}}_{start} = {d_{u} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};}} & (17) \\{\mspace{76mu}{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0};}} & (18) \\{\mspace{76mu}{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = 0};}} & (19) \\{\mspace{76mu}{{n_{shift}^{RA} = \lfloor \frac{{3d_{u}} - N_{ZC}}{N_{CS}} \rfloor};}} & (20) \\{\mspace{76mu}{{d_{start} = {{3d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};}} & (21) \\{\mspace{76mu}{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor};}} & (22) \\{\mspace{76mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{N_{ZC} - {2d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};}} & (23) \\{\mspace{76mu}{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = 0};}} & (24) \\{\mspace{76mu}{{{\overset{\_}{\overset{\_}{d}}}_{start} = 0};}} & (25) \\{\mspace{76mu}{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0};}} & (26) \\{\mspace{76mu}{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = 0};}} & (27) \\{\mspace{76mu}{{n_{shift}^{RA} = \lfloor \frac{N_{ZC} - {2d_{u}}}{N_{CS}} \rfloor};}} & (28) \\{\mspace{76mu}{{d_{start} = {{2( {N_{ZC} - {2d_{u}}} )} + {n_{shift}^{RA} \cdot N_{CS}}}};}} & (29) \\{\mspace{76mu}{{n_{group}^{RA} = \lfloor \frac{N_{ZC} - d_{u}}{d_{start}} \rfloor};}} & (30) \\{\mspace{76mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{{3d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};}} & (31) \\{\mspace{76mu}{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = 0};}} & (32) \\{\mspace{76mu}{{{\overset{\_}{\overset{\_}{d}}}_{start} = 0};}} & (33) \\{\mspace{76mu}{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0};}} & (34) \\{\mspace{76mu}{{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = 0},}} & (35)\end{matrix}$where

d_(u) is a cyclic shift corresponding to the random access sequence whena Doppler frequency shift is one time a PRACH subcarrier spacing.

With reference to the eighth aspect, in a first possible implementationof the eighth aspect, in the case of v≤(n_(shift) ^(RA)n_(group) ^(RA)+n_(shift) ^(RA)−1), the cyclic shift value determining module obtains thecyclic shift value C_(v) by using formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1)<v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift)^(RA)−1), the cyclic shift value determining module obtains the cyclicshift value C_(v) by using formula (2);

in the case of

${( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} - 1} ) < v \leq ( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} )},$the cyclic shift value determining module obtains the cyclic shift valueC_(v) by using formula (3).

With reference to the eighth aspect or the first possible implementationof the eighth aspect, in a second possible implementation of the eighthaspect, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19);

in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{2} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35); or in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2N_{ZC}}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

According to a ninth aspect, an embodiment of the present applicationprovides a random access sequence generation system, including: the basestation described in any one of the fifth aspect, or the first to theeighth possible implementations of the fifth aspect, and the userequipment UE described in any one of the sixth aspect, or the first tothe eighth possible implementations of the sixth aspect.

According to a tenth aspect, an embodiment of the present applicationprovides a random access sequence generation system, including: the basestation described in any one of the seventh aspect, or the first to thesecond possible implementations of the seventh aspect, and the userequipment UE described in any one of the eighth aspect, or the first tothe second possible implementations of the eighth aspect.

According to the random access sequence generation method, the device,and the system in the embodiments of the present application, the randomaccess sequence generation method includes: generating, by the basestation, the notification signaling, where the notification signalingincludes the indication information, the indication information is usedto instruct the user equipment UE to select the shift sequence numberfrom the range of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} ),$the shift sequence number is an integer, n_(shift) ^(RA) is the quantityof UE candidate sequence shifts in a group, n_(group) ^(RA) is thequantity of groups, n _(shift) ^(RA) is the quantity of UE candidatesequence shifts in the last length that is insufficient for a group, n_(shift) ^(RA) is the quantity of UE candidate sequence shifts in thefirst remaining sequence shifts, and

is the quantity of UE candidate sequence shifts in the second remainingsequence shifts; and sending, by the base station, the notificationsignaling to the UE, so that the UE generates the random access sequenceaccording to the indication information.

BRIEF DESCRIPTION OF DRAWINGS

To describe the technical solutions in the embodiments of the presentapplication more clearly, the following briefly describes theaccompanying drawings required for describing the embodiments.Apparently, the accompanying drawings in the following description showsome embodiments of the present application, and persons of ordinaryskill in the art may still derive other drawings from these accompanyingdrawings without creative efforts.

FIG. 1 is a flowchart of Embodiment 1 of a random access sequencegeneration method according to the present application;

FIG. 2 is a flowchart of Embodiment 2 of a random access sequencegeneration method according to the present application;

FIG. 3 is a schematic diagram of scenario 1 according to an embodimentof the present application;

FIG. 4 is a schematic diagram of scenario 2 according to an embodimentof the present application;

FIG. 5 is a schematic diagram of scenario 3 according to an embodimentof the present application;

FIG. 6 is a schematic diagram of scenario 4 according to an embodimentof the present application;

FIG. 7 is a schematic diagram of scenario 5 according to an embodimentof the present application;

FIG. 8 is a schematic diagram of scenario 6 according to an embodimentof the present application;

FIG. 9 is a schematic diagram of scenario 7 according to an embodimentof the present application;

FIG. 10 is a flowchart of Embodiment 3 of a random access sequencegeneration method according to the present application;

FIG. 11 is a flowchart of Embodiment 5 of a random access sequencegeneration method according to the present application;

FIG. 12 is a flowchart of Embodiment 6 of a random access sequencegeneration method according to the present application;

FIG. 13 is a schematic structural diagram of Embodiment 1 of a basestation according to the present application;

FIG. 14 is a schematic structural diagram of Embodiment 2 of a basestation according to the present application;

FIG. 15 is a schematic structural diagram of Embodiment 1 of userequipment according to the present application;

FIG. 16 is a schematic structural diagram of Embodiment 3 of a basestation according to the present application;

FIG. 17 is a schematic structural diagram of Embodiment 3 of userequipment according to the present application;

FIG. 18 is a schematic structural diagram of Embodiment 4 of a basestation according to the present application;

FIG. 19 is a schematic structural diagram of Embodiment 4 of userequipment according to the present application; and

FIG. 20 is a schematic structural diagram of Embodiment 5 of a basestation according to the present application.

DESCRIPTION OF EMBODIMENTS

To make the objectives, technical solutions, and advantages of theembodiments of the present application clearer, the following clearlydescribes the technical solutions in the embodiments of the presentapplication with reference to the accompanying drawings in theembodiments of the present application. Apparently, the describedembodiments are some but not all of the embodiments of the presentapplication. All other embodiments obtained by persons of ordinary skillin the art based on the embodiments of the present application withoutcreative efforts shall fall within the protection scope of the presentapplication.

FIG. 1 is a flowchart of Embodiment 1 of a random access sequencegeneration method according to the present application. As shown in FIG.1, the method in this embodiment may include:

Step 101: A base station generates notification signaling, where thenotification signaling includes indication information, the indicationinformation is used to instruct user equipment UE to select a shiftsequence number from a range of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} ),$the shift sequence number is an integer, n_(shift) ^(RA) is a quantityof UE candidate sequence shifts in a group, n_(group) ^(RA) is aquantity of groups, n _(shift) ^(RA) is a quantity of UE candidatesequence shifts in the last length that is insufficient for a group, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in firstremaining sequence shifts, and

is a quantity of UE candidate sequence shifts in second remainingsequence shifts.

It should be noted that, a “group” in the present application is asequence shift group; n_(group) ^(RA) indicates a quantity of groupsobtained after sequence shifts are grouped; n_(shift) ^(RA) indicates aquantity of UEs that can be distinguished in a sequence shift groupafter sequence shifts are grouped; n _(shift) ^(RA) indicates a quantityof UEs that are further distinguished in a sequence shift in a remaininglength that is insufficient for a group after sequence shifts aregrouped; n _(shift) ^(RA) and

indicate quantities of UEs that can be distinguished in remainingdiscrete sequence shifts of all sequence shifts other than sequenceshifts that are definitely occupied by n_(shift) ^(RA), n_(group) ^(RA),and n _(shift) ^(RA).

Step 102: The base station sends the notification signaling to the UE,so that the UE generates a random access sequence according to theindication information.

In the conventional art, the UE selects a shift sequence number from therange of 0 to (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1). Inthe present application, the base station instructs, by using thenotification signaling, the UE to select a shift sequence number fromthe range of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} ).$

In the conventional art, shift sequences are grouped to determine threeparameters: a quantity (n_(group) ^(RA)) of groups, a quantity(n_(shift) ^(RA)) of UE candidate sequence shifts in a group, and aquantity (n _(shift) ^(RA)) of UE candidate sequence shifts in the lastlength that is insufficient for a group; and a shift sequence number isselected from an interval that is determined according to the threeparameters. As can be learned, in the conventional art, duringdetermining of a range from which a shift sequence number is selected, aquantity of UEs that can be distinguished is considered from only aperspective of a group, and other remaining discrete shift sequencesobtained after grouping are not considered. In the present application,after a quantity of UEs that can be distinguished is considered from aperspective of a group, quantities of UEs that can be furtherdistinguished in other remaining discrete shift sequences obtained aftergrouping, that is, a quantity (n _(shift) ^(RA)) of UE candidatesequence shifts in first remaining sequence shifts and a quantity (

) of UE candidate sequence shifts in second remaining sequence shifts,are further considered; and the UE is instructed, by using thenotification signaling, to select a shift sequence number from the rangeof 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} ),$thereby expanding a range from which a shift sequence number isselected.

FIG. 2 is a flowchart of Embodiment 2 of a random access sequencegeneration method according to the present application. As shown in FIG.2, optionally, after step 102, the method may further include:

Step 201: The base station selects a shift sequence number from therange of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} ).$

Optionally, because the base station cannot learn a shift sequencenumber that is used by the UE when the UE sends the random accesssequence, when the base station detects the random access sequence sentby the UE, the base station sequentially chooses to traverse each shiftsequence number in the range of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} ).$Alternatively, the base station sequentially chooses to traverse eachshift sequence number in a range of 0 to X. X is an integer less than

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} ).$

Step 202: The base station obtains a cyclic shift value according to theshift sequence number.

Optionally, the base station obtains the cyclic shift value C_(v) of theUE according to the shift sequence number v by using the followingformula (1), formula (2), or formula (3):

$\begin{matrix}{{C_{v} = {d_{offset} + {d_{start}\lfloor {v/n_{shift}^{RA}} \rfloor} + {( {v\;{mod}\; n_{shift}^{RA}} )N_{CS}}}};} & (1) \\{{C_{v} = {d_{offset} + {\overset{\_}{\overset{\_}{d}}}_{start} + {( {v - {n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA}} )N_{CS}}}};} & (2) \\{{C_{v} = {d_{offset} + {\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} + {( {v - {n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}} )N_{CS}}}},} & (3)\end{matrix}$where

d_(offset) is a shift offset, d_(start) is a cyclic shift distancebetween neighboring groups, n_(shift) ^(RA) is a quantity of UEcandidate sequence shifts in a group, N_(CS) is a quantity of cyclicshifts that are occupied by a user, d _(start) is a cyclic shift valueof a first UE candidate sequence shift in the first remaining sequenceshifts, and

is a cyclic shift value of a first UE candidate sequence shift in thesecond remaining sequence shifts.

It should be noted that, d_(offset) is an integer (which is usually aconstant integer), and d_(offset) used on a base station side andd_(offset) used on a UE side need to be the same. Optionally, thatd_(offset) used on the base station side and d_(offset) used on the UEside have a same value may be implemented by means of agreement inadvance. For example, d_(offset)=0.

It should be noted that, in the present application, └Y┘ indicatesrounded-down of Y. That is, if Y is equal to 2.5, └Y┘ is equal to 2. Forexample, └v/n_(shift) ^(RA)┘ indicates rounded-down of v/n_(shift)^(RA).

It should be noted that, in the present application, mod indicates amodulo operation. For example, 4 mod 2=0, and 5 mod 2=1.

Optionally, in the case of v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1), the base station obtains the cyclic shift value C_(v) by usingformula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1)<v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift)^(RA)−1), the base station obtains the cyclic shift value C_(v) by usingformula (2); or

in the case of

${( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} - 1} ) < v \leq ( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} )},$the base station obtains the cyclic shift value C_(v) by using formula(3).

Step 203: The base station generates a detection sequence according tothe cyclic shift value, and detects, by using the detection sequence,the random access sequence sent by the UE, where the random accesssequence is generated by the UE according to the indication information.

A ZC sequence x_(u)(n) whose root is u may be defined as:

${{x_{u}(n)} = e^{{- j}\frac{\pi\;{{un}{({n + 1})}}}{N_{ZC}}}},$0≤n≤N_(ZC)−1, where N_(ZC) is a length of the ZC sequence, and u is theroot of the ZC sequence.

Specifically, the base station performs cyclic shift on the ZC sequencex_(u)(n) whose root is u. If the cyclic shift value is K, a ZC sequencegenerated according to the cyclic shift value is x_(u)((n+K)mod N_(ZC)),where N_(ZC) is a length of the ZC sequence.

Optionally, the base station performs, by using the detection sequencegenerated according to the cyclic shift value, related detection on therandom access sequence sent by the UE. The base station may performrelated detection in a time domain, or may perform detection in afrequency domain according to a frequency domain detection mannercorresponding to a time domain-related detection manner.

Optionally, in step 202, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n_(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11):

$\begin{matrix}{\mspace{79mu}{{n_{shift}^{RA} = \lfloor \frac{{4d_{u}} - N_{ZC}}{N_{CS}} \rfloor};}} & (4) \\{\mspace{79mu}{{d_{start} = {{4d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};}} & (5) \\{\mspace{79mu}{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor};}} & (6) \\{\mspace{79mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{N_{ZC} - {3d_{n}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};}} & (7) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = \lfloor {{\min( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} )}/N_{CS}} \rfloor};}} & (8) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{d}}}_{start} = {N_{ZC} - {3d_{u}} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};}} & (9) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = {\lfloor {( {{( {1 - {\min( {1,{\overset{\_}{n}}_{shift}^{RA}} )}} )( {d_{u} - {n_{group}^{RA} \cdot d_{start}}} )} + {{\min( {1,{\overset{\_}{n}}_{shift}^{RA}} )}( {{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}} )}} )/N_{CS}} \rfloor - {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}}};} & (10) \\{\mspace{79mu}{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = {N_{ZC} - {2d_{u}} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}{N_{CS}.}}}}} & (11)\end{matrix}$

Alternatively, in step 202, n_(shift) ^(RA), d_(start), n_(group) ^(RA),n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19):

$\begin{matrix}{{n_{shift}^{RA} = \lfloor \frac{N_{ZC} - {3d_{u}}}{N_{CS}} \rfloor};} & (12) \\{{d_{start} = {N_{ZC} - {3d_{u}} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (13) \\{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor};} & (14) \\{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{{4d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}};} & (15) \\{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = \lfloor {{\min( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{N_{ZC} - {3d_{u}} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} )}/N_{CS}} \rfloor};} & (16) \\{{{\overset{\_}{\overset{\_}{d}}}_{start} = {d_{u} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}};} & (17) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0};} & (18) \\{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = 0.} & (19)\end{matrix}$

Alternatively, in step 202, n_(shift) ^(RA), d_(start), n_(group) ^(RA),n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27):

$\begin{matrix}{{n_{shift}^{RA} = \lfloor \frac{{3d_{u}} - N_{ZC}}{N_{CS}} \rfloor};} & (20) \\{{d_{start} = {{3d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (21) \\{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor} & (22) \\{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{N_{ZC} - {2d_{n}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}} & (23) \\{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = 0};} & (24) \\{{{\overset{\_}{\overset{\_}{d}}}_{start} = 0};} & (25) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0};} & (26) \\{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = 0.} & (27)\end{matrix}$

Alternatively, in step 202, n_(shift) ^(RA), d_(start), n_(group) ^(RA),n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35):

$\begin{matrix}{{n_{shift}^{RA} = \lfloor \frac{N_{ZC} - {2d_{u}}}{N_{CS}} \rfloor};} & (28) \\{{d_{start} = {{3( {N_{ZC} - {2d_{u}}} )} + {n_{shift}^{RA} \cdot N_{CS}}}};} & (29) \\{n_{group}^{RA} = \lfloor \frac{N_{ZC} - d_{u}}{d_{start}} \rfloor} & (30) \\{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{{3d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}} & (31) \\{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = 0};} & (32) \\{{{\overset{\_}{\overset{\_}{d}}}_{start} = 0};} & (33) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0};} & (34) \\{{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = 0.} & (35)\end{matrix}$where

d_(u) is a cyclic shift corresponding to the random access sequence whena Doppler frequency shift is one time a PRACH subcarrier spacing.

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2N_{ZC}}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA),n _(shift)^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

It should be noted that, in the present application, max indicatesobtaining a maximum value. For example, max (0,1)=1, and max (4,5)=5.min indicates obtaining a minimum value. For example, min (0,1)=0, andmin (4,5)=4.

It should be noted that, any n_(shift) ^(RA), d_(start), n_(group)^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

that satisfy formulas (4) to (11), formulas (12) to (19), formulas (20)to (27), or formulas (28) to (35) fall within the protection scope ofthe present application.

In this embodiment, the base station selects the shift sequence numberfrom the range of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} );$the base station obtains the cyclic shift value according to the shiftsequence number; and the base station generates the detection sequenceaccording to the cyclic shift value, and detects, by using the detectionsequence, the random access sequence sent by the UE, where the randomaccess sequence is generated by the UE according to the indicationinformation. This resolves a problem that random access sequences ofmultiple UEs interfere with each other when a Doppler frequency shift isgreater than one time a PRACH subcarrier spacing and is less than twotimes the PRACH subcarrier spacing, avoids interference between randomaccess sequences of multiple UEs, and enables the base station to decodethe random access sequence more accurately.

The following describes a reason why the problem that random accesssequences of multiple UEs interfere with each other when a Dopplerfrequency shift is greater than one time a PRACH subcarrier spacing andis less than two times the PRACH subcarrier spacing in this embodimentcan be avoided in the case of n_(shift) ^(RA), d_(start), n_(group)^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), formulas (12) to (19), formulas (20) to(27), or formulas (28) to (35).

Assuming that a signal sent by the UE is r(t)e^(j2πft), r(t) is abaseband signal, and e^(j2πft) is a carrier, a signal obtained after aDoppler frequency shift mΔf is r(t)e^(j2π(f+mΔf)t), where m is apositive integer, and Δf is one time a PRACH subcarrier spacing.

According to a property of inverse fast Fourier transform (IFFT), areciprocal of a frequency domain spacing is equal to a time domainperiod, and this is equivalent to

${{\Delta\; f} = \frac{1}{N\;\Delta\; t}},$where Δf is a subcarrier spacing, Δt is a time domain sampling interval,and N is a value of discrete Fourier transform (DFT) or inverse discreteFourier transform (IDFT).

t=nΔt is set, and in this case,r(t)e^(j2π(f+mΔf)t)=(r(t)e^(j2π(mn)/N))e^(j2πft)·(r(t)e^(j2π(mn)/N)) isan equivalent baseband signal.

Property 1:

The UE sends the random access sequence to the base station. If there isa Doppler frequency shift ±mΔf between receive ends of the UE and thebase station, a random access sequence received on the receive end ofthe base station is a shift sequence of the random access sequence sentby the UE, and there is a fixed phase shift between the two sequences.

Proof: For example, the Doppler frequency shift is −mΔf. A basebandsampling signal of a time domain t=nΔt is marked as r(n). For theequivalent baseband signal (r(t)e^(−j2π(mn)/N)), N=N_(ZC) is set. Inthis case, a baseband sampling signal of the equivalent baseband signalof a ZC sequence is

${{r(n)} = {W^{\frac{{un}{({n + 1})}}{2}}W^{mn}}},$where

${{r(n)} = {W^{\frac{{un}{({n + 1})}}{2}}W^{mn}}};$and

$\begin{matrix}\begin{matrix}{{r(n)} = {W^{\frac{{un}{({n + 1})}}{2}}W^{mn}}} \\{= W^{\frac{u{\lbrack{{n{({n + 1})}} + {2\;{m{({1/u})}}n}}\rbrack}}{2}}} \\{= W^{\frac{u{\lbrack{n^{2} + n + {2\;{m{({1/u})}}n}}\rbrack}}{2}}} \\{= W^{\frac{u{\lbrack{{n{({n + {m{({1/u})}} + 1})}} + {{m{({1/u})}}{({n + {m{({1/u})}} + 1})}} - {{m{({1/u})}}{({{m{({1/u})}} + 1})}}}\rbrack}}{2}}} \\{= W^{\frac{u{\lbrack{{{({n + {m{({1/u})}}})}{({n + {m{({1/u})}} + 1})}} - {{m{({1/u})}}{({{m{({1/u})}} + 1})}}}\rbrack}}{2}}} \\{= {W^{\frac{{u{({n + {m{({1/u})}}})}}{({n + {m{({1/u})}} + 1})}}{2}}W^{\frac{{- {{um}{({1/u})}}}{({{m{({1/u})}} + 1})}}{2}}}} \\{= {{x_{u}( {n + {m( {1/u} )}} )}W^{\frac{{- {{um}{({1/u})}}}{({{m{({1/u})}} + 1})}}{2}}}}\end{matrix} & (37)\end{matrix}$where

x_(u)(n) indicates a ZC sequence whose root is u, that is,

${{x_{u}(n)} = e^{{- j}\frac{\pi\;{{un}{({n + 1})}}}{N_{ZC}}}};$and x_(u)(n+m(1/u)) indicates a shift sequence of the ZC sequence whoseroot is u, that is, right cyclic shift is performed on the ZC sequencewhose root is u by m(1/u) bits.

In formula (37),

$\frac{1}{u}$is defined as a minimum non-negative integer that satisfies ((1/×u)modN_(ZC)=1.

As can be learned from formula (37):

$\frac{1}{u}$is a cyclic shift corresponding to the random access sequence when theDoppler frequency shift is one time a PRACH subcarrier spacing, that is,a length that is of a cyclic shift between the random access sequencereceived by the base station and the random access sequence sent by theUE and that exists when the Doppler frequency shift is one time a PRACHsubcarrier spacing.

For example, if the random access sequence sent by the UE is x_(u)(n),when the Doppler frequency shift is one time a PRACH subcarrier spacing,the random access sequence received by the base station is

${x_{u}( {( {n + \frac{1}{u}} ){mod}\; N_{ZC}} )}\mspace{14mu}{or}\mspace{14mu}{{x_{u}( {( {n - \frac{1}{u}} ){mod}\; N_{ZC}} )}.}$

As can be learned from formula (15): if there is a Doppler frequencyshift −mΔf between receive ends of the UE and the base station, in atime domain, the random access sequence received by the base station isa shift sequence of the random access sequence sent by the UE, and thereis a fixed phase offset

$W^{\frac{{- {{um}{({1/u})}}}{({{m{({1/u})}} + 1})}}{2}}$(unrelated to n) between the two sequences. Similarly, for a Dopplerfrequency shift +mΔf, the random access sequence received by the basestation in a time domain is also a shift sequence of the random accesssequence sent by the UE. Details are not described herein again.

Property 2: When the Doppler frequency shift is relatively large, andthe Doppler frequency shift f_(off) is less than one time a PRACHsubcarrier spacing Δf, related peak values may appear in three positionsof sequence shifts

$\frac{1}{u},$0, and

$- \frac{1}{u}$when sequences are correlated.

That is, for the ZC sequence x_(u)(n) whose root is u, when the Dopplerfrequency shift f_(off) is less than one time a PRACH subcarrier spacingΔf, and the random access sequence sent by the UE is x_(u)(n), there isa peak value when the receive end of the base station uses a sequencex_(u)(n),

${x_{u}( {( {n + \frac{1}{u}} ){mod}\; N_{ZC}} )}\;,{{or}\mspace{14mu}{x_{u}( {( {n - \frac{1}{u}} ){mod}\; N_{ZC}} )}}$to correlate with the random access sequence sent by the UE.

It should be noted that, property 2 is determined through an experiment.

As can be learned from property 1 and property 2:

1) When a Doppler frequency shift is f_(off)=Δf+x, and 0<x<Δf, duringreceiving by the base station, peak values are generated in threepositions of shifts

${- \frac{1}{u}},{{- 2}\frac{1}{u}},$and 0.

That is, for the ZC sequence x_(u)(n) whose root is u, when a Dopplerfrequency shift is f_(off)=Δf+x(0<x<Δf), and the random access sequencesent by the UE is x_(u)(n), there is a peak value when the receive endof the base station uses a sequence x_(u)(n),

${x_{u}( {( {n + \frac{1}{u}} ){mod}\; N_{ZC}} )},{{or}\mspace{14mu}{x_{u}( {( {n - \frac{1}{u}} ){mod}\; N_{ZC}} )}}$to correlate with the random access sequence sent by the UE.

2) When the Doppler frequency shift is f_(off)=Δf+x, and 0<x<Δf, duringreceiving by the base station, peak values are generated in threepositions of shifts

${- \frac{1}{u}},{{- 2}\frac{1}{u}},$and 0.

That is, for the ZC sequence x_(u)(n) whose root is u, when the Dopplerfrequency shift is f_(off)=Δf+x(0<x<Δf), and the random access sequencesent by the UE is x_(u)(n), there is a peak value when the receive endof the base station uses a sequence x_(u)(n),

${x_{u}( {( {n - \frac{1}{u}} ){mod}\; N_{ZC}} )},{{or}\mspace{14mu}{x_{u}( {( {n - {2\frac{1}{u}}} ){mod}\; N_{ZC}} )}}$to correlate with the random access sequence sent by the UE.

Therefore, when the Doppler frequency shift is greater than one time aPRACH subcarrier spacing Δf and is less than two times the PRACHsubcarrier spacing, during receiving by the base station, peak valuesmay be generated in five positions of shifts

${- \frac{1}{u}},{{- 2}\frac{1}{u}},0,\frac{1}{u},{{and}\mspace{14mu} 2{\frac{1}{u}.}}$

That is, for the ZC sequence x_(u)(n) whose root is u, when the Dopplerfrequency shift is greater than one time a PRACH subcarrier spacing Δfand is less than two times the PRACH subcarrier spacing, and the randomaccess sequence sent by the UE is x_(u)(n), there may be a peak valuewhen the receive end of the base station uses a sequence

${x_{u}( {( {n - {2\frac{1}{u}}} ){mod}\; N_{ZC}} )},{x_{u}( {( {n - \frac{1}{u}} ){mod}\; N_{ZC}} )},{x_{u}(n)},{x_{u}( {( {n + \frac{1}{u}} ){mod}\; N_{ZC}} )},{or}$$x_{u}( {( {n + {2\frac{1}{u}}} ){mod}\; N_{ZC}} )$to correlate with the random access sequence sent by the UE.

In this embodiment, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n_(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), formulas (12) to (19), formulas (20) to(27), or formulas (28) to (35), to prevent the receive end of the basestation from allocating, to another user, a sequence corresponding tofive peak value points generated when the Doppler frequency shift isgreater than one time a PRACH subcarrier spacing and is less than twotimes the PRACH subcarrier spacing, and thereby avoid interferencebetween users that is caused by the Doppler frequency shift.

When

${\frac{1}{u} \geq \frac{N_{ZC}}{2}},$a sequence obtained when left cyclic shift is performed on the ZCsequence by

$\frac{1}{u}$is the same as a sequence obtained when right cyclic shift is performedon the ZC sequence by

$N_{ZC} - {\frac{1}{u}.}$Therefore, in the present application,

$d_{u} = \{ {\begin{matrix}p & {0 \leq p < {N_{ZC}/2}} \\{N_{ZC} - p} & {{another}\mspace{14mu}{value}}\end{matrix},{{{where}\mspace{14mu} p} = {\frac{1}{u}.}}} $As can be learned, d_(u) is a cyclic shift corresponding to the randomaccess sequence when the Doppler frequency shift is one time a PRACHsubcarrier spacing.

FIG. 3 is a schematic diagram of scenario 1 according to an embodimentof the present application. In the figure, N=N_(ZC), and satisfies

$\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}\mspace{14mu}{( {{{or}\mspace{14mu}\frac{N_{ZC} + N_{CS}}{4}} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}} ).}}$As shown in FIG. 3, sequence shifts that are occupied by 1₀, 1₊₁, 1₊₂,1⁻¹, and 1₊₂ are used as a first group, and sequence shifts that areoccupied by 2₀, 2₊₁, 2₊₂, 2⁻¹, and 2₊₂ are used as a second group. Aquantity of UE candidate sequence shifts in a group is

${n_{shift}^{RA} = \lfloor \frac{{4d_{u}} - N_{ZC}}{N_{CS}} \rfloor},$where N_(CS) indicates a quantity of cyclic shifts that are occupied bya user. For example, a sequence length is N_(ZC), and a user occupiesN_(CS) shifts. When the Doppler frequency shift is not considered, amaximum of └N_(ZC)/N_(CS)┘ users are simultaneously supported tosimultaneously send the random access sequence.

n_(shift) ^(RA) also indicates a quantity of users that can bedistinguished in a group. From a perspective of a system, n_(shift)^(RA) users can be distinguished in a group. From a perspective of a UEside, one UE may select a maximum of n_(shift) ^(RA) sequence shifts ina group.

It should be noted that, for the ZC sequence whose sequence length isN_(ZC), when the Doppler frequency shift is not considered and N_(CS)=0,the ZC sequence may have N_(ZC) candidate sequence shifts, whichrespectively correspond to cyclic shift values 0 to N_(ZC)−1. Forexample, if the ZC sequence whose root is u is marked as x_(u)(n), whenthe cyclic shift value is 0, a generated sequence thereof is x_(u)(n).When the cyclic shift value is 1, a generated sequence thereof isx_(u)(n+1). When the Doppler frequency shift is not considered andN_(CS) is greater than 0, there may be └N_(ZC)/N_(CS)┘ candidatesequence shifts, which respectively correspond to cyclic shift valuesY*N_(CS), where Y is an integer greater than or equal to 0 and less than└N_(ZC)/N_(CS)┘−1.

When the Doppler frequency shift is greater than one time a PRACHsubcarrier spacing and is less than two times the PRACH subcarrierspacing, first user equipment generates a random access sequenceaccording to a first cyclic shift value and sends the random accesssequence to the base station. When the base station detects, by using asequence corresponding to five cyclic shift values, the random accesssequence sent by the first user equipment, there may be a peak value,and differences between the cyclic shift values and the first cyclicshift value are respectively 0, d_(u), −d_(u), 2d_(u), and −2d_(u).Therefore, to avoid interference between the first user equipment andanother user equipment, none of candidate sequence shifts correspondingto the five cyclic shift values can be allocated to the another userequipment. In addition, for the base station side, this is equivalent tothat the candidate sequence shifts corresponding to the five cyclicshift values are all allocated to the first user equipment. That is, asshown in FIG. 3, sequence shifts (that is, sequence shifts that areoccupied by 1₀, 1₊₁, 1₊₂, 1⁻¹, and 1₊₂) related to “1” are used ascandidate sequence shifts of a same group of UEs, and sequence shifts(that is, sequence shifts that are occupied by 2₀, 2₊₁, 2₊₂, 2⁻¹, and2₊₂) related to “2” are used as candidate sequence shifts of a samegroup of UEs.

In addition, because the differences between the five cyclic shiftvalues and the first cyclic shift value are respectively 0,d_(u),−d_(u), 2d_(u), and −2d_(u), it can also be learned that, forfirst UE in a first group of UEs, an initial sequence shift of sequenceshifts that are occupied by 1₀ is a cyclic shift value of the first UEin the first group of UEs. For first UE in a second group of UEs, aninitial sequence shift of sequence shifts that are occupied by 2₀ is acyclic shift value of the first UE in the second group of UEs.

d_(start)=4d_(u)−N_(ZC)+n_(shift) ^(RA)·N_(CS) indicates a cyclic shiftdistance between neighboring groups, as shown by filling patterns oflattice patterns in FIG. 3.

$n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor$indicates a quantity of groups in a sequence whose sequence length isN_(ZC). As shown in FIG. 3, a quantity of groups is 2 (that is, thefirst group and the second group).

${\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{N_{ZC} - {3d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}$indicates a quantity of UE candidate sequence shifts in the last lengththat is insufficient for a group. The quantity of UE candidate sequenceshifts in the last length that is insufficient for a group is 0 in FIG.3.

n _(shift) ^(RA)=└min(d_(u)−n_(group) ^(RA)·d_(start), 4d_(u)−N_(ZC)−n_(shift) ^(RA)N_(CS))/N_(CS)┘ indicates a quantity of UE candidatesequence shifts in first remaining sequence shifts, where the firstremaining sequence shift is shown by filling patterns of stripesslanting towards left in FIG. 3.

${\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = {\lfloor {( {{( {1 - {\min( {1,{\overset{\_}{n}}_{shift}^{RA}} )}} )( {d_{u} - {n_{group}^{RA} \cdot d_{start}}} )} + {{\min( {1,{\overset{\_}{n}}_{shift}^{RA}} )}( {{4d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}} )}} )/N_{CS}} \rfloor - {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}}$indicates a quantity of UE candidate sequence shifts in second remainingsequence shifts, where the second remaining sequence shift is shown byfilling patterns of stripes slanting towards right in FIG. 3.

d _(start)=N_(ZC)−3d_(u)+n_(group) ^(RA)·d_(start)+n _(shift)^(RA)N_(CS) indicates a cyclic shift value of a first UE candidatesequence shift in the first remaining sequence shifts, and is identifiedby an arrow X in FIG. 3.

${\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = {N_{ZC} - {2d_{u}} + {n_{group}^{RA} \cdot d_{start}} + {{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}N_{CS}}}$indicates a cyclic shift value of a first UE candidate sequence shift inthe second remaining sequence shifts, and is identified by an arrow Y inFIG. 3.

For example, when N_(ZC)=839, N_(CS)=18, and d_(u)=222, a correspondingscenario may be shown in FIG. 3.

It should be noted that, filling patterns of round point patterns inFIG. 3 are used to synchronously indicate one of five shift sequencesoccupied by a group, to more easily describe how to allocate each group.

FIG. 4 is a schematic diagram of scenario 2 according to an embodimentof the present application. In the figure, N=N_(ZC), and satisfies

$\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}\mspace{14mu}{( {{{or}\mspace{14mu}\frac{N_{ZC} + N_{CS}}{4}} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}} ).}}$As shown in FIG. 4, sequence shifts that are occupied by 1₀, 1₊₁, 1₊₂,1⁻¹, and 1₊₂ are used as a first group, and sequence shifts that areoccupied by 2₀, 2₊₁, 2₊₂, 2⁻¹, and 2₊₂ are used as a second group. Aquantity of UE candidate sequence shifts in a group is

${n_{shift}^{RA} = \lfloor \frac{N_{ZC} - {3d_{u}}}{N_{CS}} \rfloor},$where N_(CS) indicates a quantity of cyclic shifts that are occupied bya user.

It should be noted that, in FIG. 4 and FIG. 3, physical meanings ofn_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

and formulas that need to be satisfied are all the same. Details are notdescribed herein again.

d_(start) is shown by filling patterns of lattice patterns in FIG. 4, n_(shift) ^(RA) is shown by filling patterns of stripes slanting towardsleft in FIGS. 4, and d _(start) is identified by an arrow X in FIG. 4.

In FIG. 4, n_(group) ^(RA) is 2, n _(shift) ^(RA) is 0,

is 0, and

is 0 (corresponding to that

is 0).

For example, when N_(ZC)=839, N_(CS)=22, and d_(u)=221, this maycorrespond to the scenario shown in FIG. 4.

It should be noted that, filling patterns of round point patterns inFIG. 4 are used to synchronously indicate one of five shift sequencesoccupied by one group, to more easily describe how to allocate eachgroup.

FIG. 5 is a schematic diagram of scenario 3 according to an embodimentof the present application. In the figure, N=N_(ZC), and satisfies

$\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}\mspace{14mu}{( {{{or}\mspace{14mu}\frac{N_{ZC} + N_{CS}}{4}} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}} ).}}$As shown in FIG. 5, sequence shifts that are occupied by 1₀, 1₊₁, 1₊₂,1⁻¹, and 1₊₂ are used as a first group, and sequence shifts that areoccupied by 2₀, 2₊₁, 2₊₂, 2⁻¹, and 2₊₂ are used as a second group. Aquantity of UE candidate sequence shifts in a group is

${n_{shift}^{RA} = \lfloor \frac{{3d_{u}} - N_{ZC}}{N_{CS}} \rfloor},$where N_(CS) indicates a quantity of cyclic shifts that are occupied bya user.

It should be noted that, in FIG. 5 and FIG. 3, physical meanings ofn_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

and formulas that need to be satisfied are all the same. Details are notdescribed herein again.

d_(start) is shown by filling patterns of lattice patterns in FIG. 5, n_(shift) ^(RA) is shown by filling patterns of stripes slanting towardsleft in FIG. 5, and d _(start) is identified by an arrow X in FIG. 5.

In FIG. 5, n_(group) ^(RA) is 2,

is 0, and

is 0 (corresponding to that

is 0).

In FIG. 5, n _(shift) ^(RA) may be 1. That is, five candidate sequenceshifts corresponding to filling patterns of characters A (which maycorrespond to 0), B (which may correspond to +d_(u)), C (which maycorrespond to +2d_(u)), D (which may correspond to −d_(u)), and E (whichmay correspond to −2d_(u)) are used as a new candidate sequence shiftand are allocated to UE.

For example, when N_(ZC)=839, N_(CS)=18, and d_(u)=220, this maycorrespond to the scenario shown in FIG. 5.

It should be noted that, filling patterns of round point patterns inFIG. 5 are used to synchronously indicate one of five shift sequencesoccupied by one group, to more easily describe how to allocate eachgroup.

FIG. 6 is a schematic diagram of scenario 4 according to an embodimentof the present application. In the figure, N=N_(ZC), and satisfies

${\frac{2}{7}N_{ZC}} \leq d_{u} \leq {\frac{N_{ZC} - N_{CS}}{3}\mspace{14mu}{( {{{or}\mspace{14mu}\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}} ).}}$As shown in FIG. 6, sequence shifts that are occupied by 1₀, 1₊₁, 1₊₂,1⁻¹, and 1₊₂ are used as a first group, and sequence shifts that areoccupied by 2₀, 2₊₁, 2₊₂, 2⁻¹, and 2₊₂ are used as a second group. Aquantity of UE candidate sequence shifts in a group is

$n_{shift}^{RA} = {\lfloor \frac{N_{ZC} - {3d_{u}}}{N_{CS}} \rfloor.}$

It should be noted that, in FIG. 6 and FIG. 3, n_(shift) ^(RA)d_(start),n_(group) ^(RA), and n _(shift) ^(RA) have same physical meanings, andonly formulas that need to be satisfied are different. An analysisprocess is similar to that of FIG. 3. Details are not described hereinagain.

d_(start)=N_(ZC)−3d_(u)+n_(shift) ^(RA)·N_(CS) indicates a cyclic shiftdistance between neighboring groups, and is shown by filling patterns oflattice patterns in FIG. 6.

$n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor$indicates a quantity of groups in a sequence whose sequence length isN_(ZC). As shown in FIG. 6, a quantity of groups is 2.

${\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{{4d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}$indicates a quantity of UE candidate sequence shifts in the last lengththat is insufficient for a group. As shown in FIG. 6, the quantity of UEcandidate sequence shifts in the last length that is insufficient for agroup may be 1. That is, five candidate sequence shifts corresponding tofilling patterns of characters A, B, C, D, and E are used as a newcandidate sequence shift and are allocated to UE.

n _(shift) ^(RA)=└min(d_(u)−n_(group) ^(RA)·d_(start), N_(ZC)−3d_(u)−n_(shift) ^(RA)N_(CS))/N_(CS)┘ indicates a quantity of UE candidatesequence shifts in first remaining sequence shifts. The first remainingsequence shift is shown by filling patterns of stripes slanting towardsleft in FIG. 6.

${\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0$indicates that a quantity of UE candidate sequence shifts in secondremaining sequence shifts is 0.

d _(start)=d_(u)+n_(group) ^(RA)·d_(start)+n _(shift) ^(RA)N_(CS) acyclic shift value of a first UE candidate sequence shift in the firstremaining sequence shifts, and is identified by an arrow X in FIG. 6.

${\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} = {0\mspace{14mu}{( {{{corresponding}\mspace{14mu}{to}\mspace{14mu}{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA}} = 0} ).}}$

For example, when N_(ZC)=839, N_(CS)=22, and d_(u)=264, this maycorrespond to the scenario shown in FIG. 6.

It should be noted that, filling patterns of round point patterns inFIG. 6 are used to synchronously indicate one of five shift sequencesoccupied by one group, and filling patterns of vertical line patternsare used to synchronously indicate sequence shifts that are occupied byfilling patterns of characters, to more easily describe how to allocateeach group.

FIG. 7 is a schematic diagram of scenario 5 according to an embodimentof the present application. In the figure, N=N_(ZC), and satisfies

${\frac{2}{7}N_{ZC}} \leq d_{u} \leq {\frac{N_{ZC} - N_{CS}}{3}\mspace{14mu}{( {{{or}\mspace{14mu}\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}} ).}}$As shown in FIG. 7, sequence shifts that are occupied by 1₀, 1₊₁, 1₊₂,1¹⁻¹, and 1₊₂ are used as a first group, and sequence shifts that areoccupied by 2₀, 2₊₁, 2₊₂, 2⁻¹, and 2₊₂ are used as a second group. Aquantity of UE candidate sequence shifts in a group is

${n_{shift}^{RA} = \lfloor \frac{N_{ZC} - {3d_{u}}}{N_{CS}} \rfloor},$where N_(CS) indicates a quantity of cyclic shifts that are occupied bya user.

It should be noted that, in FIG. 7 and FIG. 6, physical meanings ofn_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

and formulas that need to be satisfied are all the same. Details are notdescribed herein again.

d_(start) is shown by filling patterns of lattice patterns in FIG. 7, n_(shift) ^(RA) is shown by filling patterns of stripes slanting towardsleft in FIG. 7, and d _(start) is identified by an arrow X in FIG. 7.

In FIG. 7, n_(group) ^(RA) is 2, n _(shift) ^(RA) is 0,

is 0, and

is 0 (corresponding to that

is 0).

For example, when N_(ZC)=839, N_(CS)=22, and d_(u)=261, this maycorrespond to the scenario shown in FIG. 7.

It should be noted that, filling patterns of round point patterns inFIG. 7 are used to synchronously indicate one of five shift sequencesoccupied by one group, to more easily describe how to allocate eachgroup.

FIG. 8 is a schematic diagram of scenario 6 according to an embodimentof the present application. In the figure, N=N_(ZC), and satisfies

$\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < {\frac{2N_{ZC}}{5}\mspace{14mu}{( {{{or}\mspace{14mu}\frac{N_{ZC} + N_{CS}}{3}} \leq d_{u} \leq \frac{2N_{ZC}}{5}} ).}}$As shown in FIG. 8, sequence shifts that are occupied by 1₀, 1₊₁, 1₊₂,1⁻¹, and 1₊₂ are used as a first group, and sequence shifts that areoccupied by 2₀, 2₊₁, 2₊₂, 2⁻¹, and 2₊₂ are used as a second group. Aquantity of UE candidate sequence shifts in a group is

$n_{shift}^{RA} = {\lfloor \frac{{3d_{u}} - N_{ZC}}{N_{CS}} \rfloor.}$

It should be noted that, in FIG. 8 and FIG. 3, n_(shift) ^(RA),d_(start), n_(group) ^(RA), and n _(shift) ^(RA) have same physicalmeanings, and only formulas that need to be satisfied are different. Ananalysis process is similar to that of FIG. 3. Details are not describedherein again.

d_(start)=3d_(u)−N_(ZC)+n_(shift) ^(RA)·N_(CS) indicates a cyclic shiftdistance between neighboring groups, and is shown by filling patterns oflattice patterns in FIG. 8.

$n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor$indicates a quantity of groups in a sequence whose sequence length isN_(ZC). As shown in FIG. 8, the quantity of groups is 2.

${\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{N_{ZC} - {2d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}$indicates a quantity of UE candidate sequence shifts in the last lengththat is insufficient for a group. As shown in FIG. 8, the quantity of UEcandidate sequence shifts in the last length that is insufficient for agroup may be 1. That is, five candidate sequence shifts corresponding tofilling patterns of characters A, B, C, D, and E are used as a newcandidate sequence shift and are allocated to UE.

n _(shift) ^(RA)=0 indicates that a quantity of UE candidate sequenceshifts in first remaining sequence shifts is 0.

${\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0$indicates that a quantity of UE candidate sequence shifts in secondremaining sequence shifts is 0.

${\overset{\_}{\overset{\_}{d}}}_{start} = {{0\mspace{14mu}{( {{{corresponding}\mspace{14mu}{to}\mspace{14mu}{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}} = 0} ).{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start}}} = {0\mspace{14mu}{( {{{corresponding}\mspace{14mu}{to}\mspace{14mu}{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA}} = 0} ).}}}$

For example, when N_(ZC)=839, N_(CS)=22, and d_(u)=300, this maycorrespond to the scenario shown in FIG. 8.

FIG. 9 is a schematic diagram of scenario 7 according to an embodimentof the present application. In the figure, N=N_(ZC), and satisfies

$\frac{2N_{ZC}}{5} \leq d_{u} \leq {\frac{N_{ZC} - N_{CS}}{2}\mspace{14mu}{( {{{or}\mspace{14mu}\frac{2N_{ZC}}{5}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}} ).}}$As shown in FIG. 9, sequence shifts that are occupied by 1₀, 1₊₁, 1₊₂,1⁻¹, and 1₊₂ are used as a first group, and sequence shifts that areoccupied by 2₀, 2₊₁, 2₊₂, 2⁻¹, and 2₊₂ are used as a second group. Aquantity of UE candidate sequence shifts in a group is

$n_{shift}^{RA} = {\lfloor \frac{N_{ZC} - {2d_{u}}}{N_{CS}} \rfloor.}$

It should be noted that, in FIG. 9 and FIG. 3, n_(shift) ^(RA),d_(start), n_(group) ^(RA), and n _(shift) ^(RA) have same physicalmeanings, and only formulas that need to be satisfied are different. Ananalysis process is similar to that of FIG. 3. Details are not describedherein again.

d_(start)=2(N_(ZC)−2d_(u))+n_(shift) ^(RA)·N_(CS) indicates a cyclicshift distance between neighboring groups, and is shown by fillingpatterns of lattice patterns in FIG. 9.

$n_{group}^{RA} = \lfloor \frac{N_{ZC} - d_{u}}{d_{start}} \rfloor$indicates a quantity of groups in a sequence whose sequence length isN_(ZC). As shown in FIG. 9, the quantity of groups is 2.

${\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{{3d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}$indicates a quantity of UE candidate sequence shifts in the last lengththat is insufficient for a group. As shown in FIG. 9, the quantity of UEcandidate sequence shifts in the last length that is insufficient for agroup may be 1. That is, five candidate sequence shifts corresponding tofilling patterns of characters A, B, C, D, and E are used as a newcandidate sequence shift and are allocated to UE.

n _(shift) ^(RA)=0 indicates that a quantity of UE candidate sequenceshifts in first remaining sequence shifts is 0.

${\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0$indicates that a quantity of UE candidate sequence shifts in secondremaining sequence shifts is 0.

${\overset{\_}{\overset{\_}{d}}}_{start} = {{0\mspace{14mu}{( {{{corresponding}\mspace{14mu}{to}\mspace{14mu}{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}} = 0} ).{\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start}}} = {0\mspace{14mu}{( {{{corresponding}\mspace{14mu}{to}\mspace{14mu}{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA}} = 0} ).}}}$

For example, when N_(ZC)=839, N_(CS)=22, and d_(u)=393, this maycorrespond to the scenario shown in FIG. 9.

FIG. 10 is a flowchart of Embodiment 3 of a random access sequencegeneration method according to the present application. As shown in FIG.10, the method in this embodiment may include:

Step 1001: UE receives notification signaling from a base station, wherethe notification signaling includes indication information, theindication information is used to instruct the UE to select a shiftsequence number from a range of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} ),$the shift sequence number is an integer, n_(shift) ^(RA) is a quantityof UE candidate sequence shifts in a group, n_(group) ^(RA) is aquantity of groups, n _(shift) ^(RA) is a quantity of UE candidatesequence shifts in the last length that is insufficient for a group, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in firstremaining sequence shifts, and

is a quantity of UE candidate sequence shifts in second remainingsequence shifts.

Step 1002: The UE selects a shift sequence number according to thenotification signaling.

Specifically, the UE selects the shift sequence number from the range of0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} )$according to the notification signaling.

Step 1003: The UE obtains a cyclic shift value according to the shiftsequence number.

Step 1004: The UE generates a random access sequence according to thecyclic shift value.

In this embodiment, the UE selects the shift sequence number from therange of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} )$according to the notification signaling, so that after a quantity of UEsthat can be distinguished is considered from a perspective of a group,quantities of UEs that can be further distinguished in other remainingdiscrete shift sequences obtained after grouping are further considered,thereby expanding a range from which a shift sequence number isselected.

Embodiment 4 of the random access sequence generation method is asfollows:

Optionally, based on Embodiment 3 of the random access sequencegeneration method in the present application, step 1003 may specificallyinclude:

obtaining, by the UE, the cyclic shift value C_(v) according to theshift sequence number v by using formula (1), formula (2), or formula(3).

Optionally, in the case of v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1), the UE obtains the cyclic shift value C_(v) by using formula(1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1)<v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift)^(RA)−1), the UE obtains the cyclic shift value C_(v) by using formula(2);

in the case of

${( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} - 1} ) < v \leq ( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} )},$the UE obtains the cyclic shift value C_(v) by using formula (3).

Optionally, step 1004 may specifically include:

generating, by the UE, the random access sequence x_(u,C) _(v) (n)according to the cyclic shift value C_(v) by using the following formula(36):x _(u,C) _(v) (n)=x _(u)((n+C _(v))mod N _(ZC))  (36),where

N_(ZC) is a sequence length, and a ZC sequence whose root is u isdefined as:

${{x_{u}(n)} = e^{{- j}\frac{\pi\;{{un}{({n + 1})}}}{N_{ZC}}}},$0≤n≤n_(ZC)−1.

In this embodiment, detailed descriptions of n_(shift) ^(RA), d_(start),n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

are the same as those in Embodiment 2 of the random access sequencegeneration method. Details are not described herein again.

FIG. 11 is a flowchart of Embodiment 5 of a random access sequencegeneration method according to the present application. As shown in FIG.11, the method in this embodiment may include:

Step 1101: A base station selects a shift sequence number.

Specifically, the base station selects the shift sequence number v froma range of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} ),$where v is an integer, n_(shift) ^(RA) is a quantity of user equipmentUE candidate sequence shifts in a group, n_(group) ^(RA) is a quantityof groups, n _(shift) ^(RA) is a quantity of UE candidate sequenceshifts in the last length that is insufficient for a group, n _(shift)^(RA) is a quantity of UE candidate sequence shifts in first remainingsequence shifts, and

is a quantity of UE candidate sequence shifts in second remainingsequence shifts.

Step 1102: The base station obtains a cyclic shift value according tothe shift sequence number.

Specifically, the base station obtains the cyclic shift value C_(v)according to the shift sequence number v by using the following formula(1), formula (2), or formula (3):

$\begin{matrix}{{C_{v} = {d_{offset} + {d_{start}\lfloor {v/n_{shift}^{RA}} \rfloor} + {( {v\;{mod}\; n_{shift}^{RA}} )N_{CS}}}};} & (1) \\{{C_{v} = {d_{offset} + {\overset{\_}{\overset{\_}{d}}}_{start} + {( {v - {n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA}} )N_{CS}}}};} & (2) \\{{C_{v} = {d_{offset} + {\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} + {( {v - {n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}} )N_{CS}}}},} & (3)\end{matrix}$where

d_(offset) is a shift offset, d_(start) is a cyclic shift distancebetween neighboring groups, n_(shift) ^(RA) is a quantity of UEcandidate sequence shifts in a group, N_(CS) is a quantity of cyclicshifts that are occupied by a user, d _(start) is a cyclic shift valueof a first UE candidate sequence shift in first remaining sequenceshifts, and

is a cyclic shift value of a first UE candidate sequence shift in secondremaining sequence shifts.

In this embodiment, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n_(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11); or n_(shift) ^(RA), d_(start), n_(group)^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or n_(shift) ^(RA), d_(start), n_(group)^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27); or n_(shift) ^(RA), d_(start), n_(group)^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

It should be noted that, in this embodiment, detailed descriptions ofn_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

are the same as those in Embodiment 2 of the random access sequencegeneration method. Details are not described herein again.

Optionally, in the case of v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1), the base station obtains the cyclic shift value C_(v) by usingformula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1)<v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift)^(RA)−1), the base station obtains the cyclic shift value C_(v) by usingformula (2);

in the case of

${( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} - 1} ) < v \leq ( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} )},$the base station obtains the cyclic shift value C_(v) by using formula(3).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2\; N_{ZC}}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2\; N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2\; N_{ZC}}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2\; N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

In this embodiment, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n_(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

that satisfy formulas (4) to (11), formulas (12) to (19), formulas (20)to (27), or formulas (28) to (35) are used, and the shift sequencenumber is selected from the range of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} ),$thereby expanding a range from which a shift sequence number isselected.

FIG. 12 is a flowchart of Embodiment 6 of a random access sequencegeneration method according to the present application. As shown in FIG.12, the method in this embodiment may include:

Step 1201: UE selects a shift sequence number.

Specifically, the UE selects the shift sequence number v from a range of0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} ).$

v is an integer, n_(shift) ^(RA) is a quantity of UE candidate sequenceshifts in a group, n_(group) ^(RA) is a quantity of groups, n _(shift)^(RA) is a quantity of UE candidate sequence shifts in the last lengththat is insufficient for a group, n _(shift) ^(RA) is a quantity of UEcandidate sequence shifts in first remaining sequence shifts, and

is a quantity of UE candidate sequence shifts in second remainingsequence shifts.

Step 1202: The UE obtains a cyclic shift value according to the shiftsequence number.

Specifically, the UE obtains the cyclic shift value C_(v) according tothe shift sequence number v by using the following formula (1), formula(2), or formula (3):

$\begin{matrix}{{C_{v} = {d_{offset} + {d_{start}\lfloor {v/n_{shift}^{RA}} \rfloor} + {( {v\;{mod}\; n_{shift}^{RA}} )N_{CS}}}};} & (1) \\{{C_{v} = {d_{offset} + {\overset{\_}{\overset{\_}{d}}}_{start} + {( {v - {n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA}} )N_{CS}}}};} & (2) \\{{C_{v} = {d_{offset} + {\overset{\_}{\overset{\_}{\overset{\_}{d}}}}_{start} + {( {v - {n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA}} )N_{CS}}}},} & (3)\end{matrix}$where

d_(offset) is a shift offset, d_(start) is a cyclic shift distancebetween neighboring groups, n_(shift) ^(RA) is a quantity of UEcandidate sequence shifts in a group, N_(CS) is a quantity of cyclicshifts that are occupied by a user, d _(start) is a cyclic shift valueof a first UE candidate sequence shift in the first remaining sequenceshifts, and

is a cyclic shift value of a first UE candidate sequence shift in thesecond remaining sequence shifts.

Step 1203: The UE generates a random access sequence according to thecyclic shift value.

Specifically, the UE generates the random access sequence x_(u,C) _(v)(n) according to the cyclic shift value C_(v) by using the followingformula (36):x _(u,C) _(v) (n)=x _(u)((n+C _(v))mod N _(ZC))  (36),where

N_(ZC) is a sequence length, and a ZC sequence whose root is u isdefined as:

${{x_{u}(n)} = e^{{- j}\frac{\pi\;{{un}{({n + 1})}}}{N_{ZC}}}},$0≤n≤N_(ZC)−1.

In this embodiment, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n_(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11); or n_(shift) ^(RA), d_(start), n_(group)^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or n_(shift) ^(RA), d_(start), n_(group)^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27); or n_(shift) ^(RA), d_(start), n_(group)^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

It should be noted that, in this embodiment, detailed descriptions ofn_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

are the same as those in Embodiment 2 of the random access sequencegeneration method. Details are not described herein again.

Optionally, in the case of v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1), the base station obtains the cyclic shift value C_(v) by usingformula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1)<v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift)^(RA)−1), the base station obtains the cyclic shift value C_(v) by usingformula (2).

in the case of

${( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} - 1} ) < v \leq ( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} )},$the base station obtains the cyclic shift value C_(v) by using formula(3).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2\; N_{ZC}}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2\; N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2\; N_{ZC}}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2\; N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

In this embodiment, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n_(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

that satisfy formulas (4) to (11), formulas (12) to (19), formulas (20)to (27), or formulas (28) to (35) are used, and the shift sequencenumber is selected from the range of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} ),$thereby expanding a range from which a shift sequence number isselected.

FIG. 13 is a schematic structural diagram of Embodiment 1 of a basestation according to the present application. As shown in FIG. 13, thebase station in this embodiment may include: a generation module 1301and a sending module 1302. The generation module 1301 is configured togenerate notification signaling, where the notification signalingincludes indication information, the indication information isconfigured to instruct user equipment UE to select a shift sequencenumber from a range of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} ),$the shift sequence number is an integer, n_(shift) ^(RA) is a quantityof UE candidate sequence shifts in a group, n_(group) ^(RA) is aquantity of groups, n _(shift) ^(RA) is a quantity of UE candidatesequence shifts in the last length that is insufficient for a group, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in firstremaining sequence shifts, and

is a quantity of UE candidate sequence shifts in second remainingsequence shifts. The sending module 1302 is configured to send thenotification signaling to the UE, so that the UE generates a randomaccess sequence according to the indication information.

The base station in this embodiment may be configured to execute thetechnical solution in the method embodiment shown in FIG. 1. Animplementation principle and a technical effect thereof are similar, anddetails are not described herein again.

FIG. 14 is a schematic structural diagram of Embodiment 2 of a basestation according to the present application. As shown in FIG. 14, basedon the structure of the base station shown in FIG. 13, the base stationin this embodiment may further include: a shift sequence numberdetermining module 1303, a cyclic shift value determining module 1304,and a random access sequence detection module 1305. The shift sequencenumber determining module 1303 is configured to select a shift sequencenumber from the range of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} ).$The cyclic shift value determining module 1304 is configured to obtain acyclic shift value according to the shift sequence number. The randomaccess sequence detection module 1305 is configured to: generate adetection sequence according to the cyclic shift value, and detect, byusing the detection sequence, a random access sequence sent by the UE,where the random access sequence is generated by the UE according to theindication information.

Optionally, the cyclic shift value determining module 1304 isspecifically configured to:

obtain the cyclic shift value C_(v) according to the shift sequencenumber v by using formula (1), formula (2), or formula (3).

Optionally, in the case of v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1), the cyclic shift value determining module 1304 obtains thecyclic shift value C_(v) by using formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1)<v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift)^(RA)−1), the cyclic shift value determining module 1304 obtains thecyclic shift value C_(v) by using formula (2);

in the case of

${( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} - 1} ) < v \leq ( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} )},$the cyclic shift value determining module 1304 obtains the cyclic shiftvalue C_(v) by using formula (3).

Optionally, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift)^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11); or

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27); or

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{{2N_{ZC}}\;}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{{2N_{ZC}}\;}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{{2N_{ZC}}\;}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{{2N_{ZC}}\;}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

The base station in this embodiment may be configured to execute thetechnical solution in the method embodiment shown in FIG. 2. Animplementation principle and a technical effect thereof are similar, anddetails are not described herein again.

FIG. 15 is a schematic structural diagram of Embodiment 1 of userequipment according to the present application. As shown in FIG. 15, theuser equipment in this embodiment may include: a receiving module 1501,a shift sequence number determining module 1502, a cyclic shift valuedetermining module 1503, and a random access sequence generation module1504. The receiving module 1501 is configured to receive notificationsignaling from a base station, where the notification signaling includesindication information, the indication information is used to instructthe UE to select a shift sequence number from a range of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} ),$the shift sequence number is an integer, n_(shift) ^(RA) is a quantityof UE candidate sequence shifts in a group, n_(group) ^(RA) is aquantity of groups, n _(shift) ^(RA) is a quantity of UE candidatesequence shifts in the last length that is insufficient for a group, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in firstremaining sequence shifts, and

is a quantity of UE candidate sequence shifts in second remainingsequence shifts. The shift sequence number determining module 1502 isconfigured to select a shift sequence number from the range of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} )$according to the notification signaling. The cyclic shift valuedetermining module 1503 is configured to obtain a cyclic shift valueaccording to the shift sequence number. The random access sequencegeneration module 1504 is configured to generate a random accesssequence according to the cyclic shift value.

The UE in this embodiment may be configured to execute the technicalsolution in the method embodiment shown in FIG. 10. An implementationprinciple and a technical effect thereof are similar, and details arenot described herein again.

Embodiment 2 of the user equipment is as follows:

Optionally, based on Embodiment 1 of the user equipment of the presentapplication, the cyclic shift value determining module 1503 isspecifically configured to:

obtain the cyclic shift value C_(v) according to the shift sequencenumber v by using formula (1), formula (2), or formula (3).

Optionally, in the case of v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1), the cyclic shift value determining module 1503 obtains thecyclic shift value C_(v) by using formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1)<v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift)^(RA)−1), the cyclic shift value determining module 1503 obtains thecyclic shift value C_(v) by using formula (2);

in the case of

${( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} - 1} ) < v \leq ( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} )},$the cyclic shift value determining module 1503 obtains the cyclic shiftvalue C_(v) by using formula (3).

Optionally, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift)^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11); or

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27); or

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{{2N_{ZC}}\;}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{{2N_{ZC}}\;}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{{2N_{ZC}}\;}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2\; N_{ZC}}{5} < d_{u} < \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Optionally, the random access sequence generation module 1504 isspecifically configured to:

generate the random access sequence x_(u,C) _(v) (n) according to thecyclic shift value C_(v) by using the following formula (36):x _(u,C) _(v) (n)=x _(u)((n+C _(v))mod N _(ZC))  (36),where

N_(ZC) is a sequence length, and a ZC sequence whose root is u isdefined as:

${{x_{u}(n)} = e^{{- j}\frac{\pi\;{{un}{({n + 1})}}}{N_{ZC}}}},$0≤n≤N_(ZC)−1.

The UE in this embodiment may be configured to execute the technicalsolution in Embodiment 4 of the random access sequence generationmethod. An implementation principle and a technical effect thereof aresimilar, and details are not described herein again.

The present application further provides a random access sequencegeneration system, including the base station in Embodiment 1 orEmbodiment 2 of the base station, and the user equipment in Embodiment 1or Embodiment 2 of the user equipment.

FIG. 16 is a schematic structural diagram of Embodiment 3 of a basestation according to the present application. As shown in FIG. 16, thebase station in this embodiment may include a shift sequence numberdetermining module 1601 and a cyclic shift value determining module1602. The shift sequence number determining module 1601 is configured toselect a shift sequence number v from a range of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} ),$where v is in integer, n_(shift) ^(RA) is a quantity of user equipmentUE candidate sequence shifts in a group, n_(group) ^(RA) is a quantityof groups, n _(shift) ^(RA) is a quantity of UE candidate sequenceshifts in the last length that is insufficient for a group, n _(shift)^(RA) is a quantity of UE candidate sequence shifts in first remainingsequence shifts, and

is a quantity of UE candidate sequence shifts in second remainingsequence shifts.

The cyclic shift value determining module 1602 is configured to obtainthe cyclic shift value C_(v) according to the shift sequence number v byusing formula (1), formula (2), or formula (3).

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11); or n_(shift) ^(RA), d_(start), n_(group)^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or n_(shift) ^(RA), d_(start), n_(group)^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27); or n_(shift) ^(RA), d_(start), n_(group)^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Optionally, in the case of v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1), the cyclic shift value determining module 1602 obtains thecyclic shift value C_(v) by using formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1)<v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift)^(RA)−1), the cyclic shift value determining module 1602 obtains thecyclic shift value C_(v) by using formula (2);

in the case of

${( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} - 1} ) < v \leq ( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} )},$the cyclic shift value determining module 1602 obtains the cyclic shiftvalue C_(v) by using formula (3).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{{2N_{ZC}}\;}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{{2N_{ZC}}\;}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{{2N_{ZC}}\;}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{{2N_{ZC}}\;}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

The base station in this embodiment may be configured to execute thetechnical solution in the method embodiment shown in FIG. 11. Animplementation principle and a technical effect thereof are similar, anddetails are not described herein again.

FIG. 17 is a schematic structural diagram of Embodiment 3 of userequipment according to the present application. As shown in FIG. 17, thebase station in this embodiment may include: a shift sequence numberdetermining module 1701, a cyclic shift value determining module 1702,and a random access sequence generation module 1703. The shift sequencenumber determining module 1701 is configured to select a shift sequencenumber v from a range of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} ),$where v is an integer, n_(shift) ^(RA) is a quantity of UE candidatesequence shifts in a group, n_(group) ^(RA) is a quantity of groups, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in the lastlength that is insufficient for a group, n _(shift) ^(RA) is a quantityof UE candidate sequence shifts in first remaining sequence shifts, and

is a quantity of UE candidate sequence shifts in second remainingsequence shifts. The cyclic shift value determining module 1702 isconfigured to obtain a cyclic shift value C_(v) according to the shiftsequence number v by using formula (1), formula (2), or formula (3). Therandom access sequence generation module 1703 is configured to generatea random access sequence x_(u,C) _(v) (n) according to the cyclic shiftvalue C_(v) by using formula (36).

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11); or n_(shift) ^(RA), d_(start), n_(group)^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or n_(shift) ^(RA), d_(start), n_(group)^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27); or n_(shift) ^(RA), d_(start), n_(group)^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Optionally, in the case of v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1), the cyclic shift value determining module 1702 obtains thecyclic shift value C_(v) by using formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1)<v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift)^(RA)−1), the cyclic shift value determining module 1702 obtains thecyclic shift value C_(v) by using formula (2);

in the case of

${( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} - 1} ) < v \leq ( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} )},$the cyclic shift value determining module 1702 obtains the cyclic shiftvalue C_(v) by using formula (3).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{{2N_{ZC}}\;}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2\; N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2\; N_{ZC}}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2\; N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

The user equipment in this embodiment may be configured to execute thetechnical solution in the method embodiment shown in FIG. 12. Animplementation principle and a technical effect thereof are similar, anddetails are not described herein again.

The present application further provides a random access sequencegeneration system, including the base station in Embodiment 3 of thebase station, and the user equipment in Embodiment 3 of the userequipment.

FIG. 18 is a schematic structural diagram of Embodiment 4 of a basestation according to the present application. As shown in FIG. 18, thebase station in this embodiment may include: a processor 1801 and atransmitter 1802. The processor 1801 is configured to generatenotification signaling, where the notification signaling includesindication information, the indication information is used to instructuser equipment UE to select a shift sequence number from a range of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} ),$the shift sequence number is an integer, n_(shift) ^(RA) is a quantityof UE candidate sequence shifts in a group, n_(group) ^(RA) is aquantity of groups, n _(shift) ^(RA) is a quantity of UE candidatesequence shifts in the last length that is insufficient for a group, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in firstremaining sequence shifts, and

is a quantity of UE candidate sequence shifts in second remainingsequence shifts. The transmitter 1802 is configured to send thenotification signaling to the UE, so that the UE generates a randomaccess sequence according to the indication information.

Optionally, the processor 1802 is further configured to:

select a shift sequence number from the range of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} );$

obtain a cyclic shift value according to the shift sequence number; and

generate a detection sequence according to the cyclic shift value, anddetect, by using the detection sequence, a random access sequence sentby the UE, where the random access sequence is generated by the UEaccording to the indication information.

Optionally, the obtaining, by the processor 1802, a cyclic shift valueaccording to the shift sequence number specifically includes:

obtaining the cyclic shift value C_(v) according to the shift sequencenumber v by using formula (1), formula (2), or formula (3).

Optionally, in the case of v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1), the processor 1802 obtains the cyclic shift value C_(v) byusing formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1)<v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift)^(RA)−1), the processor 1802 obtains the cyclic shift value C_(v) byusing formula (2);

in the case of

${( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} - 1} ) < v \leq ( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} )},$the processor 1802 obtains the cyclic shift value C_(v) by using formula(3).

Optionally, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift)^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11); or

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27); or

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2\;}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2\;}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2\;}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2\;}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

start satisfy formulas (12) to (19).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2\; N_{ZC}}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2\; N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2\; N_{ZC}}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2\; N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

The base station in this embodiment may be configured to execute thetechnical solution in the method embodiment shown in FIG. 1 or FIG. 2.An implementation principle and a technical effect thereof are similar,and details are not described herein again.

FIG. 19 is a schematic structural diagram of Embodiment 4 of userequipment according to the present application. As shown in FIG. 19, theuser equipment in this embodiment may include a receiver 1901 and aprocessor 1902. The receiver 1901 is configured to receive notificationsignaling from a base station, where the notification signaling includeindication information, the indication information is used to instructthe UE to select a shift sequence number from a range of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} ),$the shift sequence number is an integer, n_(shift) ^(RA)is a quantity ofUE candidate sequence shifts in a group, n_(group) ^(RA) is a quantityof groups, n _(shift) ^(RA) is a quantity of UE candidate sequenceshifts in the last length that is insufficient for a group, n _(shift)^(RA) is a quantity of UE candidate sequence shifts in first remainingsequence shifts, and

is a quantity of UE candidate sequence shifts in second remainingsequence shifts. The processor 1902 is configured to: select a shiftsequence number from the range of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} )$according to the notification signaling, obtain a cyclic shift valueaccording to the shift sequence number, and generate a random accesssequence according to the cyclic shift value.

Optionally, the obtaining, by the processor 1902, a cyclic shift valueaccording to the shift sequence number specifically includes:

obtaining the cyclic shift value C_(v) according to the shift sequencenumber v by using formula (1), formula (2), or formula (3).

Optionally, in the case of v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1), the processor 1902 obtains the cyclic shift value C_(v) byusing formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1)<v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift)^(RA)−1), the processor 1902 obtains the cyclic shift value C_(v) byusing formula (2);

in the case of

${( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} - 1} ) < v \leq ( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} )},$the processor 1902 obtains the cyclic shift value C_(v) by using formula(3).

Optionally, n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift)^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11); or

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27); or

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2\;}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

formulas (4) to (11), in the case of

${{\frac{2\;}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2\;}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11) in the case of

${{\frac{2\;}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2\; N_{ZC}}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2\; N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2\; N_{ZC}}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2\; N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Optionally, the generating, by the processor 1902, a random accesssequence according to the cyclic shift value specifically includes:

generating the random access sequence x_(u,C) _(v) (n) according to thecyclic shift value C_(v) by using the following formula (36);x _(u,C) _(v) (n)=x _(u)((n+C _(v))mod N _(ZC))  (36),where

N_(ZC) is a sequence length, and a ZC sequence whose root is u isdefined as:

${{x_{u}(n)} = e^{{- j}\frac{\pi\;{{un}{({n + 1})}}}{N_{ZC}}}},$0≤n≤N_(ZC)−1.

The UE in this embodiment may be configured to execute the technicalsolution in Embodiment 3 or Embodiment 4 of the random access sequencegeneration method. An implementation principle and a technical effectthereof are similar, and details are not described herein again.

FIG. 20 is a schematic structural diagram of Embodiment 5 of a basestation according to the present application. As shown in FIG. 20, thebase station in this embodiment may include a processor 2001 and amemory 2002. The apparatus may further include a transmitter 2003 and areceiver 2004. The transmitter 2003 and the receiver 2004 may beconnected to the processor 2001. The transmitter 2003 is configured tosend data or information. The receiver 2004 is configured to receivedata or information. The memory 2002 stores an executable instruction.When the apparatus runs, the processor 2001 communicates with the memory2002. The processor 2001 invokes the executable instruction in thememory 2002, to perform the following operations:

selecting a shift sequence number v from a range of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} ),$where v is an integer, n_(shift) ^(RA) is a quantity of user equipmentUE candidate sequence shifts in a group, n_(group) ^(RA) is a quantityof groups, n _(shift) ^(RA) is a quantity of UE candidate sequenceshifts in the last length that is insufficient for a group, n _(shift)^(RA) is a quantity of UE candidate sequence shifts in first remainingsequence shifts, and

is a quantity of UE candidate sequence shifts in second remainingsequence shifts; and

obtaining a cyclic shift value C_(v) according to the shift sequencenumber v by using formula (1), formula (2), or formula (3).

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11); or n_(shift) ^(RA), d_(start), n_(group)^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or n_(shift) ^(RA), d_(start), n_(group)^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27); or n_(shift) ^(RA), d_(start), n_(group)^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Optionally, in the case of v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1), the processor 2001 obtains the cyclic shift value C_(v) byusing formula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1)<v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift)^(RA)−1), the processor 2001 obtains the cyclic shift value C_(v) v byusing formula (2);

in the case of

${( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} - 1} ) < v \leq ( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} )},$the processor 2001 obtains the cyclic shift value C_(v) by using formula(3).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2\; N_{ZC}}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2\; N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2\; N_{ZC}}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2\; N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

The base station in this embodiment may be configured to execute thetechnical solution in the method embodiment shown in FIG. 11. Animplementation principle and a technical effect thereof are similar, anddetails are not described herein again.

In a schematic structural diagram of Embodiment 5 of user equipment, theuser equipment in this embodiment has a same structure as that of thebase station shown in FIG. 20, and may also include a processor and amemory. The apparatus may further include a transmitter and a receiver.The transmitter and the receiver may be connected to the processor. Thetransmitter is configured to send data or information. The receiver isconfigured to receive data or information. The memory stores anexecutable instruction. When the apparatus runs, the processorcommunicates with the memory. The processor invokes the executableinstruction in the memory, to perform the following operations:

selecting a shift sequence number v from a range of 0 to

$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} ),$where v is an integer, n_(shift) ^(RA) is a quantity of UE candidatesequence shifts in a group, n_(group) ^(RA) is a quantity of groups, n_(shift) ^(RA) is a quantity of UE candidate sequence shifts in the lastlength that is insufficient for a group, n _(shift) ^(RA) is a quantityof UE candidate sequence shifts in first remaining sequence shifts, and

is a quantity of UE candidate sequence shifts in second remainingsequence shifts;

obtaining a cyclic shift value C_(v) according to the shift sequencenumber v by using formula (1), formula (2), or formula (3); and

generating a random access sequence x_(u,C) _(v) (n) according to thecyclic shift value C_(v) by using formula (36).

n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11); or n_(shift) ^(RA), d_(start), n_(group)^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19); or n_(shift) ^(RA), d_(start), n_(group)^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27); or n_(shift) ^(RA), d_(start), n_(group)^(RA), n _(shift) ^(RA), n _(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Optionally, in the case of v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1), the processor obtains the cyclic shift value C_(v) by usingformula (1);

in the case of (n_(shift) ^(RA)n_(group) ^(RA)+n _(shift)^(RA)−1)<v≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)+n _(shift)^(RA)−1), the processor obtains the cyclic shift value C_(v) by usingformula (2);

in the case of

${( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} - 1} ) < v \leq ( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} )},$the processor obtains the cyclic shift value C_(v) by using formula (3).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} \leq {\frac{2}{7}N_{ZC}}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (4) to (11), in the case of

${{\frac{2}{7}N_{ZC}} < d_{u} \leq \frac{N_{ZC} + N_{CS}}{3}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (12) to (19).

Optionally, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2\; N_{ZC}}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2\; N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

Alternatively, in the case of

${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} \leq \frac{2\; N_{ZC}}{5}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (20) to (27), in the case of

${\frac{2\; N_{ZC}}{5} < d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$n_(shift) ^(RA), d_(start), n_(group) ^(RA), n _(shift) ^(RA), n_(shift) ^(RA),

, d _(start), and

satisfy formulas (28) to (35).

The user equipment in this embodiment may be configured to execute thetechnical solution in the method embodiment shown in FIG. 12. Animplementation principle and a technical effect thereof are similar, anddetails are not described herein again.

Persons of ordinary skill in the art may understand that all or some ofthe steps of the method embodiments may be implemented by a programinstructing relevant hardware. The program may be stored in acomputer-readable storage medium. When the program runs, the steps ofthe method embodiments are performed. The foregoing storage mediumincludes any medium that can store program code, such as a ROM, a RAM, amagnetic disk, or an optical disc.

Finally, it should be noted that the foregoing embodiments are merelyintended for describing the technical solutions of the presentapplication, but not for limiting the present application. Although thepresent application is described in detail with reference to theforegoing embodiments, persons of ordinary skill in the art shouldunderstand that they may still make modifications to the technicalsolutions described in the foregoing embodiments or make equivalentreplacements to some or all technical features thereof, withoutdeparting from the scope of the technical solutions of the embodimentsof the present application.

What is claimed is:
 1. A method for generating a random access sequence,performed by a terminal device in a communication system, comprising:obtaining a cyclic shift value C_(v) according to a shift sequencenumber v, whereinC _(v) =d _(offset) +d _(start) └v/n _(shift) ^(RA)┘+(v mod n _(shift)^(RA))N _(CS)  (1), v is an integer, d_(offset) is a constant integer ord_(offset) is zero, and N_(CS) is a quantity of cyclic shifts that areoccupied by a user, wherein n_(shift) ^(RA) and d_(start) satisfyformulas (4) and (5), respectively, or n_(shift) ^(RA) and d_(start)satisfy formulas (12) and (13), respectively, or n_(shift) ^(RA) andd_(start) satisfy formulas (20) and (21), respectively, or n_(shift)^(RA) and d_(start) satisfy formulas (28) and (29), respectively,wherein $\begin{matrix}{{n_{shift}^{RA} = \lfloor \frac{{4\; d_{u}} - N_{ZC}}{N_{CS}} \rfloor},} & (4) \\{{d_{start} = {{4\; d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}},} & (5) \\{{n_{shift}^{RA} = \lfloor \frac{N_{ZC} - {3\; d_{u}}}{N_{CS}} \rfloor},} & (12) \\{{d_{start} = {N_{ZC} - {3\; d_{u}} + {n_{shift}^{RA} \cdot N_{CS}}}},} & (13) \\{{n_{shift}^{RA} = \lfloor \frac{{3\; d_{u}} - N_{ZC}}{N_{CS}} \rfloor},} & (20) \\{{d_{start} = {{3\; d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}},} & (21) \\{{n_{shift}^{RA} = \lfloor \frac{N_{ZC} - {2\; d_{u}}}{N_{CS}} \rfloor},} & (28) \\{{d_{start} = {{2( {N_{ZC} - {2\; d_{u}}} )} + {n_{shift}^{RA} \cdot N_{CS}}}},} & (29)\end{matrix}$ and wherein N_(ZC) is a length of the random accesssequence, a root of the random access sequence is u,$d_{u} = \{ {\begin{matrix}p & {0 \leq p < {N_{Z\; C}/2}} \\{N_{Z\; C} - p} & {{another}\mspace{14mu}{value}}\end{matrix},} $  and p is a minimum non-negative integer thatsatisfies (pu)mod N_(ZC)=1; generating the random access sequenceaccording to the cyclic shift value C_(v); and transmitting the randomaccess sequence.
 2. The method according to claim 1, wherein for${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA) and d_(start) satisfy formulas (4) and (5), or for${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} + N_{CS}}{3}},$ n_(shift) ^(RA) and d_(start) satisfy formulas (12) and (13), or for${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2N_{ZC}}{5}},$  n_(shift)^(RA) and d_(start) satisfy formulas (20) and (21), or for${\frac{2\; N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{2}},$ n_(shift) ^(RA) and d_(start) satisfy formulas (28) and (29).
 3. Themethod according to claim 1, wherein the generating the random accesssequence according to the cyclic shift value C_(v), comprising:generating the random access sequence x_(u,C) _(v) (n) according to thecyclic shift value C_(v) meeting formula (36):x _(u,C) _(v) (n)=x _(u)((n+C _(v))mod N _(ZC))  (36),  wherein the rootof the random access sequence u satisfies${{x_{u}(n)} = e^{{- j}\frac{\pi\;{{un}{({n + 1})}}}{N_{ZC}}}},$ 0≤n≤N_(ZC)−1.
 4. The method according to claim 1, wherein a range ofthe shift sequence number v is from 0 to$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} ),$wherein for n_(shift) ^(RA) and d_(start) satisfy formulas (4) and (5),n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA), and

satisfy formulas (6) to (8) and (10), or for n_(shift) ^(RA) andd_(start) satisfy formulas (12) and (13), n_(group) ^(RA), n _(shift)^(RA), n _(shift) ^(RA), and

satisfy formulas (14) to (16) and (18), or for n_(shift) ^(RA) andd_(start) satisfy formulas (20) and (21), n_(group) ^(RA), n _(shift)^(RA), n _(shift) ^(RA), and

satisfy formulas (22) to (24) and (26), or for n_(shift) ^(RA) andd_(start) satisfy formulas (28) and (29), n_(group) ^(RA), n _(shift)^(RA), n _(shift) ^(RA), and

satisfy formulas (30) to (32) and (34), wherein $\begin{matrix}{\mspace{79mu}{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor},}} & (6) \\{\mspace{79mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{N_{ZC} - {3\; d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{cs}} \rfloor,0} )}},}} & (7) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = \lfloor {{\min( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{{4\; d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} )}/N_{CS}} \rfloor},}} & (8) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = {\lfloor {( {{( {1 - {\min( {1,{\overset{\_}{n}}_{shift}^{RA}} )}} )( {d_{u} - {n_{group}^{RA} \cdot d_{start}}} )} + {{\min( {1,{\overset{\_}{n}}_{shift}^{RA}} )}( {{4\; d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}} )}} )/N_{CS}} \rfloor - {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA}}},} & (10) \\{\mspace{79mu}{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor},}} & (14) \\{\mspace{79mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{{4\; d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}},}} & (15) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = \lfloor {{\min( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{N_{ZC} - {3\; d_{u}} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} )}/N_{CS}} \rfloor},}} & (16) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0},}} & (18) \\{\mspace{79mu}{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor},}} & (22) \\{\mspace{79mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{N_{ZC} - {2\; d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{cs}} \rfloor,0} )}},}} & (23) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = 0},}} & (24) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0},}} & (26) \\{\mspace{79mu}{{n_{group}^{RA} = \lfloor \frac{N_{ZC} - d_{u}}{d_{start}} \rfloor},}} & (30) \\{\mspace{79mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{{3\; d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}},}} & (31) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = 0},}} & (32) \\{\mspace{79mu}{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0.}} & (34)\end{matrix}$
 5. The method according to claim 4, before the obtainingthe cyclic shift value C_(v), further comprises: receiving indicationinformation which indicates the range of the shift sequence number v. 6.The method according to claim 4, wherein v≤(n_(shift) ^(RA)n_(group)^(RA)+n _(shift) ^(RA)−1).
 7. The method according to claim 1, whereind_(u) is a cyclic shift corresponding to the random access sequence whena Doppler frequency shift is a physical random access channel (PRACH)subcarrier spacing.
 8. An apparatus, comprising a processor, theprocessor is coupled to a memory, wherein the processor is configuredto: obtain a cyclic shift value c_(v) according to a shift sequencenumber v, whereinC _(v) =d _(offset) +d _(start) └v/n _(shift) ^(RA)┘+(v mod n _(shift)^(RA))N _(CS)  (1), v is an integer, d_(offset) is a constant integer ord_(offset) is zero, and N_(cs) is a quantity of cyclic shifts that areoccupied by a user, wherein n_(shift) ^(RA) and d_(start) satisfyformulas (4) and (5), respectively, or n_(shift) ^(RA) and d_(start)satisfy formulas (12) and (13), respectively, or n_(shift) ^(RA) andd_(start) satisfy formulas (20) and (21), respectively, or n_(shift)^(RA) and d_(start) satisfy formulas (28) and (29), respectively,wherein $\begin{matrix}{{n_{shift}^{RA} = \lfloor \frac{{4\; d_{u}} - N_{ZC}}{N_{CS}} \rfloor},} & (4) \\{{d_{start} = {{4\; d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}},} & (5) \\{{n_{shift}^{RA} = \lfloor \frac{N_{ZC} - {3\; d_{u}}}{N_{CS}} \rfloor},} & (12) \\{{d_{start} = {N_{ZC} - {3\; d_{u}} + {n_{shift}^{RA} \cdot N_{CS}}}},} & (13) \\{{n_{shift}^{RA} = \lfloor \frac{{3\; d_{u}} - N_{ZC}}{N_{CS}} \rfloor},} & (20) \\{{d_{start} = {{3\; d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}},} & (21) \\{{n_{group}^{RA} = \lfloor \frac{N_{ZC} - {2\; d_{u}}}{N_{CS}} \rfloor};} & (28) \\{{d_{start} = {{2( {N_{ZC} - {2\; d_{u}}} )} + {n_{shift}^{RA} \cdot N_{CS}}}},} & (29)\end{matrix}$ and wherein N_(ZC) is a length of a random accesssequence, and a root of the random access sequence is u,$d_{u} = \{ {\begin{matrix}p & {0 \leq p < {N_{Z\; C}/2}} \\{N_{Z\; C} - p} & {{another}\mspace{14mu}{value}}\end{matrix},} $  and p is a minimum non-negative integer thatsatisfies (pu)mod N_(ZC)=1; the processor is further configured togenerate the random access sequence according to the cyclic shift valueC_(v); and transmit the random access sequence.
 9. The apparatusaccording to claim 8, wherein for${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA) and d_(start) satisfy formulas (4) and (5), or for${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA) and d_(start) satisfy formulas (12) and (13), or for${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2\; N_{ZC}}{5}},$ n_(shift) ^(RA) and d_(start) satisfy formulas (20) and (21), or for${\frac{2\; N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA) and d_(start) satisfy formulas (28) and (29).
 10. Theapparatus according to claim 8, wherein the processor is furtherconfigured to: generate the random access sequence x_(u,C) _(v) (n)according to the cyclic shift value C_(v) meeting formula (36):x _(u,C) _(v) (n)=x _(u) ((n+C _(v))mod N _(ZC))  (36),  wherein theroot of the random access sequence u satisfies${{x_{u}(n)} = e^{{- j}\frac{\pi\;{{un}{({n + 1})}}}{N_{ZC}}}},$ 0≤n≤N_(ZC)−1.
 11. The apparatus according to claim 8, wherein a rangeof the shift sequence number v is from 0 to$( {{n_{shift}^{RA}n_{group}^{RA}} + {\overset{\_}{n}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} + {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} - 1} ),$wherein for n_(shift) ^(RA) and d_(start) satisfy formulas (4) and (5),n_(group) ^(RA), n _(shift) ^(RA), n _(shift) ^(RA), and

satisfy formulas (6) to (8) and (10), or for n_(shift) ^(RA) andd_(start) satisfy formulas (12) and (13), n_(group) ^(RA), n _(shift)^(RA), n _(shift) ^(RA), and

satisfy formulas (14) to (16) and (18), or for n_(shift) ^(RA) andd_(start) satisfy formulas (20) and (21), n_(group) ^(RA), n _(shift)^(RA), n _(shift) ^(RA), and

satisfy formulas (22) to (24) and (26), or for n_(shift) ^(RA) andd_(start) satisfy formulas (28) and (29), n_(group) ^(RA), n _(shift)^(RA), n _(shift) ^(RA), and

satisfy formulas (30) to (32) and (34), wherein $\begin{matrix}{\mspace{79mu}{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor},}} & (6) \\{\mspace{79mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{N_{ZC} - {3\; d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}},}} & (7) \\{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = \lfloor {{\min( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{{4\; d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} )}/N_{CS}} \rfloor},} & (8) \\{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = {\lfloor {( {{( {1 - {\min( {1,{\overset{\_}{n}}_{shift}^{RA}} )}} )( {d_{u} - {n_{group}^{RA} \cdot d_{start}}} )} + {{\min( {1,{\overset{\_}{n}}_{shift}^{RA}} )}( {{4\; d_{u}} - N_{ZC} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}} )}} )/N_{CS}} \rfloor - {\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA}}},} & (10) \\{\mspace{79mu}{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor},}} & (14) \\{\mspace{79mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{{4\; d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}},}} & (15) \\{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = \lfloor {{\min( {{d_{u} - {n_{group}^{RA} \cdot d_{start}}},{N_{ZC} - {3\; d_{u}} - {{\overset{\_}{n}}_{shift}^{RA}N_{CS}}}} )}/N_{CS}} \rfloor},} & (16) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0},}} & (18) \\{\mspace{79mu}{{n_{group}^{RA} = \lfloor \frac{d_{u}}{d_{start}} \rfloor},}} & (22) \\{\mspace{79mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{N_{ZC} - {2\; d_{u}} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}},}} & (23) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = 0},}} & (24) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0},}} & (26) \\{\mspace{79mu}{{n_{group}^{RA} = \lfloor \frac{N_{ZC} - d_{u}}{d_{start}} \rfloor},}} & (30) \\{\mspace{79mu}{{{\overset{\_}{n}}_{shift}^{RA} = {\max( {\lfloor \frac{{3\; d_{u}} - N_{ZC} - {n_{group}^{RA} \cdot d_{start}}}{N_{CS}} \rfloor,0} )}},}} & (31) \\{\mspace{79mu}{{{\overset{\_}{\overset{\_}{n}}}_{shift}^{RA} = 0},}} & (32) \\{\mspace{79mu}{{\overset{\_}{\overset{\_}{\overset{\_}{n}}}}_{shift}^{RA} = 0.}} & (34)\end{matrix}$
 12. The apparatus according to claim 11, whereinv≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1).
 13. The apparatusaccording to claim 8, wherein d_(u) is a cyclic shift corresponding tothe random access sequence when a Doppler frequency shift is a physicalrandom access channel (PRACH) subcarrier spacing.
 14. The apparatusaccording to claim 8, wherein the processor further executesinstructions stored in the memory to: receive indication informationwhich indicates a range of the shift sequence number v.
 15. Anon-transitory storage medium comprising instructions which, whenexecuted by an apparatus, cause the apparatus to: obtain a cyclic shiftvalue C_(v), according to a shift sequence number v, whereinC _(v) =d _(offset) +d _(start) └v/n _(shift) ^(RA)┘+(v mod n _(shift)^(RA))N _(CS)  (1), v is an integer, d_(offset) is a constant integer ord_(offset) is zero, and N_(cs) is a quantity of cyclic shifts that areoccupied by a user, wherein n_(shift) ^(RA) and d_(start) satisfyformulas (4) and (5), respectively, or n_(shift) ^(RA) and d_(start)satisfy formulas (12) and (13), respectively, or n_(shift) ^(RA) andd_(start) satisfy formulas (20) and (21), respectively, or n_(shift)^(RA) and d_(start) satisfy formulas (28) and (29), respectively,wherein $\begin{matrix}{{n_{shift}^{RA} = \lfloor \frac{{4\; d_{u}} - N_{ZC}}{N_{CS}} \rfloor},} & (4) \\{{d_{start} = {{4\; d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}},} & (5) \\{{n_{shift}^{RA} = \lfloor \frac{N_{ZC} - {3\; d_{u}}}{N_{CS}} \rfloor},} & (12) \\{{d_{start} = {N_{ZC} - {3\; d_{u}} + {n_{shift}^{RA} \cdot N_{CS}}}},} & (13) \\{{n_{shift}^{RA} = \lfloor \frac{{3\; d_{u}} - N_{ZC}}{N_{CS}} \rfloor},} & (20) \\{{d_{start} = {{3\; d_{u}} - N_{ZC} + {n_{shift}^{RA} \cdot N_{CS}}}},} & (21) \\{{n_{shift}^{RA} = \lfloor \frac{N_{ZC} - {2\; d_{u}}}{N_{CS}} \rfloor},} & (28) \\{{d_{start} = {{2( {N_{ZC} - {2\; d_{u}}} )} + {n_{shift}^{RA} \cdot N_{CS}}}},} & (29)\end{matrix}$ and wherein N_(ZC) is a length of a random accesssequence, and a root of the random access sequence is u,$d_{u} = \{ {\begin{matrix}p & {0 \leq p < {N_{Z\; C}/2}} \\{N_{Z\; C} - p} & {{another}\mspace{14mu}{value}}\end{matrix},} $  and p is a minimum non-negative integer thatsatisfies (pu)mod N_(ZC) =1; generate the random access sequenceaccording to the cyclic shift value C_(v); and transmit the randomaccess sequence.
 16. The non-transitory storage medium according toclaim 15, wherein for${\frac{N_{ZC} + N_{CS}}{4} \leq d_{u} < {\frac{2}{7}N_{ZC}}},$ n_(shift) ^(RA) and d_(start) satisfy formulas (4) and (5), or for${{\frac{2}{7}N_{ZC}} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA) and d_(start) satisfy formulas (12) and (13), or for${\frac{N_{ZC} + N_{CS}}{3} \leq d_{u} < \frac{2\; N_{ZC}}{5}},$ n_(shift) ^(RA) and d_(start) satisfy formulas (20) and (21), or for${\frac{2\; N_{ZC}}{5} \leq d_{u} \leq \frac{N_{ZC} - N_{CS}}{3}},$ n_(shift) ^(RA) and d_(start) satisfy formulas (28) and (29).
 17. Thenon-transitory storage medium according to claim 15, wherein thegenerating the random access sequence according to the cyclic shiftvalue C_(v) comprises: generating the random access sequence x_(u,C)_(v) (n) according to the cyclic shift value C_(v) meeting formula (36):x _(u,C) _(v) (n)=x _(u)((n+C _(v))mod N _(ZC))  (36),  wherein the rootof the random access sequence u satisfies${{x_{u}(n)} = e^{{- j}\frac{\pi\;{{un}{({n + 1})}}}{N_{ZC}}}},$ 0≤n≤N_(ZC)−1.
 18. The non-transitory storage medium according to claim15, wherein a range of the shift sequence number v is from 0 tov≤(n_(shift) ^(RA)n_(group) ^(RA)+n _(shift) ^(RA)−1).
 19. Thenon-transitory storage according to claim 15, wherein the instructions,when executed by the apparatus, further cause the apparatus to: receiveindication information which indicates a range of the shift sequencenumber v.
 20. The non-transitory storage according to claim 15, whereind_(u) is a cyclic shift corresponding to the random access sequence whena Doppler frequency shift is a physical random access channel (PRACH)subcarrier spacing.